4117 search results - page 503 / 824 » On the Satisfiability of Complex Constraints |
286
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
191
click to vote
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Stereo matching and volumetric reconstruction are the most explored 3D scene recovery techniques in computer vision. Many existing approaches assume perspective input images and us...
206
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
218
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
164
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...