908 search results - page 161 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
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, ...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
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...
JAL
2006
14 years 11 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...