Sciweavers

1142 search results - page 30 / 229
» Approximability of Clausal Constraints
Sort
View
EOR
2008
93views more  EOR 2008»
15 years 2 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
ATAL
2007
Springer
15 years 6 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
214
Voted
CP
2009
Springer
16 years 2 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
15 years 7 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
SIROCCO
2008
15 years 3 months ago
Distributed Approximation Algorithm for Resource Clustering
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
Olivier Beaumont, Nicolas Bonichon, Philippe Ducho...