279 search results - page 30 / 56 » Reduction approaches for robust shortest path problems |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
MEMOCODE
2007
IEEE
15 years 4 months ago
2007
IEEE
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
92
Voted
AAAI
2010
14 years 11 months ago
2010
On the surface, bidirectional search (BDS) is an attractive idea with the potential for significant asymptotic reductions in search effort. However, the results in practice often ...
174
click to vote
CRV
2011
IEEE
13 years 9 months ago
2011
IEEE
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...