1040 search results - page 124 / 208 » Rounding algorithms for covering problems |
126
click to vote
ICLP
1995
Springer
15 years 8 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
136
click to vote
EACL
2003
ACL Anthology
15 years 6 months ago
2003
ACL Anthology
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
140
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
168
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
127
Voted
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...