661 search results - page 51 / 133 » Combining Information using Hard Constraints |
249
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
148
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
117
click to vote
EOR
2006
15 years 3 months ago
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
173
click to vote
CVPR
2011
IEEE
15 years 2 days ago
2011
IEEE
We present a distributed representation of pose and appearance of people called the “poselet activation vector”. First we show that this representation can be used to estimate...
140
click to vote
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...