866 search results - page 150 / 174 » On Dynamic Shortest Paths Problems |
102
click to vote
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
Power consumption has gained much saliency in circuit design recently. One design problem is modelled as ”Under a timing constraint, to minimize power as much as possible”. Pr...
100
click to vote
RECOMB
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
112
click to vote
MDM
2009
Springer
15 years 6 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
—A material handling (MH) system of a general assembly line dispatching parts from inventory to working buffers could be complicated and costly to operate. Generally it is extrem...
SARA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...