592 search results - page 18 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
152
Voted
ICCAD
2002
IEEE
15 years 11 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
116
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
150
Voted
AUSAI
2008
Springer
15 years 4 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
142
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
126
Voted
JDA
2010
14 years 9 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...