1142 search results - page 66 / 229 » Approximability of Clausal Constraints |
133
click to vote
EOR
2006
15 years 6 months ago
2006
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...
132
click to vote
IROS
2007
IEEE
16 years 18 days ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
188
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
174
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
204
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...