Sciweavers

3082 search results - page 134 / 617
» New Bounds for the Controller Problem
Sort
View
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 9 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 6 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
IPL
2002
118views more  IPL 2002»
15 years 4 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot
ICCV
2011
IEEE
14 years 4 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
ALMOB
2006
97views more  ALMOB 2006»
15 years 4 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi