2398 search results - page 266 / 480 » Constraint Programming and Graph Algorithms |
170
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
172
click to vote
CGO
2008
IEEE
16 years 27 days ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
175
click to vote
SI3D
2003
ACM
15 years 11 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
159
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
188
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...