126 search results - page 5 / 26 » Surrogate constraint normalization for the set covering prob... |
124
click to vote
AI
2004
Springer
14 years 11 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
103
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
71
Voted
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
116
click to vote
FOCM
2010
14 years 10 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
111
click to vote
CONSTRAINTS
2007
14 years 11 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...