2796 search results - page 91 / 560 » The coolest path problem |
238
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
152
Voted
DAC
2008
ACM
16 years 5 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...
137
click to vote
TLCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
159
click to vote
MEMOCODE
2007
IEEE
15 years 11 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 ...
119
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— In this paper, we explore the problem of threedimensional motion planning in highly cluttered and unstructured outdoor environments. Because accurate sensing and modeli...