6562 search results - page 375 / 1313 » Noetherianity and Combination Problems |
168
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
182
click to vote
ICARCV
2006
IEEE
16 years 26 days ago
2006
IEEE
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
194
click to vote
ASPDAC
2004
ACM
16 years 7 days ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
170
click to vote
CP
2004
Springer
16 years 6 days ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
217
click to vote
SIGIR
2003
ACM
16 years 2 days ago
2003
ACM
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...