388 search results - page 65 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
123
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
130
click to vote
RTCSA
1998
IEEE
15 years 4 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
107
click to vote
ICCAD
2009
IEEE
14 years 9 months ago
2009
IEEE
A parallel computing approach for large-scale SPICE-accurate circuit simulation is described that is based on a new preconditioned iterative solver. The preconditioner involves the...
111
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
We introduce MAGENTA’s commercial multi-agent systems technology, and illustrate its practical use by describing a field-tested application in the area of logistics/scheduling....