2398 search results - page 229 / 480 » Constraint Programming and Graph Algorithms |
177
click to vote
CASES
2010
ACM
15 years 4 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
162
click to vote
SIAMDM
2010
15 years 4 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
167
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
180
click to vote
PAMI
2007
15 years 6 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
296
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...