Sciweavers

107 search results - page 11 / 22
» Workforce planning with parallel algorithms
Sort
View
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
CONCURRENCY
2006
148views more  CONCURRENCY 2006»
14 years 9 months ago
An adaptive parallel query processing middleware for the Grid
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
Vinícius F. V. da Silva, Márcio L. D...
COLCOM
2007
IEEE
15 years 4 months ago
Collaborative motion planning of autonomous robots
—In disaster areas, office buildings, or at home, multiple autonomous networked mobile robots may act instead of human beings. These robots have to move to their destination so ...
Takashi Okada, Razvan Beuran, Junya Nakata, Yasuo ...
AIPS
2000
14 years 11 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
ICRA
2007
IEEE
137views Robotics» more  ICRA 2007»
15 years 3 months ago
A Hybrid Active Global Localisation Algorithm for Mobile Robots
— Localisation is one of the most important tasks to be accomplished in order to realize the complete autonomy of a mobile robot. In this paper, a new strategy for global localis...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...