2313 search results - page 220 / 463 » On Heuristic Time Hierarchies |
151
click to vote
IJCAI
2003
15 years 8 months ago
2003
This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It propose...
167
click to vote
IJCAI
2003
15 years 8 months ago
2003
This paper proposes a unique map learning method for mobile robots based on the co-visibility infor mation of objects i.e., the information on whether two objects are visible at...
181
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
163
click to vote
COR
2010
15 years 6 months ago
2010
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
148
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...