6562 search results - page 135 / 1313 » Noetherianity and Combination Problems |
144
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
124
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
139
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
146
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
153
click to vote
WSC
2008
15 years 7 months ago
2008
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...