Sciweavers

810 search results - page 94 / 162
» Solving Time-Dependent Planning Problems
Sort
View
COR
2007
176views more  COR 2007»
13 years 8 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
AUTOMATICA
2006
101views more  AUTOMATICA 2006»
13 years 8 months ago
A risk-sensitive approach to total productive maintenance
While risk-sensitive (RS) approaches for designing plans of total productive maintenance are critical in manufacturing systems, there is little in the literature by way of theoret...
Abhijit Gosavi
AIPS
2010
13 years 10 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
ICCAD
2000
IEEE
102views Hardware» more  ICCAD 2000»
14 years 13 days ago
Provably Good Global Buffering Using an Available Buffer Block Plan
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
WPES
2004
ACM
14 years 1 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah