Sciweavers

177 search results - page 31 / 36
» arc 2008
Sort
View
JAIR
2008
98views more  JAIR 2008»
13 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
TROB
2008
113views more  TROB 2008»
13 years 7 months ago
An Optimality Principle Governing Human Walking
Abstract--In this paper, we investigate different possible strategies underlying the formation of human locomotor trajectories in goal-directed walking. Seven subjects were asked t...
Gustavo Arechavaleta, Jean-Paul Laumond, Halim Hic...
COR
2008
160views more  COR 2008»
13 years 6 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 8 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
TPHOL
2008
IEEE
14 years 1 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain