592 search results - page 86 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
137
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
148
click to vote
JSAT
2006
15 years 2 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
124
click to vote
NIPS
2008
15 years 4 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
174
Voted
BMCBI
2011
14 years 10 months ago
2011
Background: It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor...
131
Voted
JAIR
2007
15 years 2 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...