1144 search results - page 188 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
EWRL
2008
14 years 11 months ago
2008
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
73
Voted
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
We study the problem of localizing repair packets when packets are lost. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast “group” wi...