661 search results - page 51 / 133 » Combining Information using Hard Constraints |
200
Voted
POPL
2004
ACM
16 years 25 days 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...
118
click to vote
SAT
2009
Springer
15 years 7 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...
EOR
2006
15 years 16 days 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...
137
click to vote
CVPR
2011
IEEE
14 years 8 months 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...
109
click to vote
CASES
2003
ACM
15 years 5 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...