2313 search results - page 50 / 463 » On Heuristic Time Hierarchies |
152
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
167
click to vote
UAI
2004
15 years 7 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
150
click to vote
COR
2010
15 years 6 months ago
2010
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retai...
175
click to vote
EOR
2006
15 years 6 months ago
2006
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show exte...
151
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...