Sciweavers

2354 search results - page 92 / 471
» Assignment Problems
Sort
View
MFCS
2010
Springer
13 years 8 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
SETN
2004
Springer
14 years 3 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
LICS
2009
IEEE
14 years 4 months ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 10 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
WSC
2008
14 years 11 days ago
A comparative study of genetic algorithm components in simulation-based optimisation
In this paper, we present a comparative study of different stochastic components of genetic algorithms for simulationbased optimisation of the buffer allocation problem. We explor...
Birkan Can, Andreas Beham, Cathal Heavey