Sciweavers

4313 search results - page 574 / 863
» Using time travel to diagnose computer problems
Sort
View
AIPS
2010
15 years 10 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
ATAL
2005
Springer
15 years 9 months ago
Automated resource-driven mission phasing techniques for constrained agents
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...
Jianhui Wu, Edmund H. Durfee
CDC
2009
IEEE
217views Control Systems» more  CDC 2009»
15 years 8 months ago
Discrete invasive weed optimization algorithm: application to cooperative multiple task assignment of UAVs
This paper presents a novel discrete population based stochastic optimization algorithm inspired from weed colonization. Its performance in a discrete benchmark, timecost trade-off...
Mohsen Ramezani Ghalenoei, Hossein Hajimirsadeghi,...
ANOR
2008
90views more  ANOR 2008»
15 years 7 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason
193
Voted
CCE
2007
15 years 7 months ago
Water networks security: A two-stage mixed-integer stochastic program for sensor placement under uncertainty
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
Vicente Rico-Ramírez, Sergio Frausto-Hern&a...