Skip to search formSkip to main contentSkip to account menu

Dynamic dispatch

Known as: Single dispatch, Dispatch, Dynamic method dispatch 
In computer science, dynamic dispatch is the process of selecting which implementation of a polymorphic operation (method or function) to call at run… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
.NET Framework version historyAd hoc polymorphismAdaC++

Broader (1)

Method (computer programming)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An Improved Particle Swarm Optimization for Nonconvex Economic Dispatch Problems
This paper presents an efficient approach for solving economic dispatch (ED) problems with nonconvex cost functions using an… 
Highly Cited
2010
Highly Cited
2010
Co-optimization of generation unit commitment and transmission switching with N-1 reliability
Currently, there is a national push for a smarter electric grid, one that is more controllable and flexible. The full control of… 
Highly Cited
2009
Highly Cited
2009
Uncertainty Management in the Unit Commitment Problem
Uncertainty in power systems operations has been traditionally managed by multistage decision making and operating reserve… 
Highly Cited
2009
Highly Cited
2009
Scheduling of Demand Side Resources Using Binary Particle Swarm Optimization
Interruptible loads represent highly valuable demand side resources within the electricity industry. However, maximizing their… 
Highly Cited
2003
Highly Cited
2003
Discrete particle swarm optimization algorithm for unit commitment
This paper proposes integrating a discrete binary particle swarm optimization (BPSO) method with the Lambda-iteration method for… 
Highly Cited
2003
Highly Cited
2003
A multiple-crane-constrained scheduling problem in a container terminal
Highly Cited
2000
Highly Cited
2000
Electricity Restructuring: Deregulation or Reregulation?
We discuss the lessons that can be gleaned from the experience with electricity restructuring to date. The gains from… 
Highly Cited
1995
Highly Cited
1995
From Coloured Petri Nets to Object Petri Nets
  • C. Lakos
  • Application and Theory of Petri Nets
  • 1995
  • Corpus ID: 19021362
This paper seeks to establish within a formal framework how Coloured Petri Nets can be enhanced to produce Object Petri Nets. It… 
Highly Cited
1982
Highly Cited
1982
A new frequency channel assignment algorithm in high capacity mobile communication systems
A new algorithm for frequency channel assignment in mobile radio communication is proposed. The algorithm uses flexible fixed… 
Review
1977
Review
1977
Optimal power dispatchߞA comprehensive survey
This paper reviews the progress of optimal dispatch, also called economic dispatch, since its inception to the present in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)