Sciweavers

607 search results - page 55 / 122
» Unifying Exact Completions
Sort
View
CEC
2005
IEEE
15 years 4 months ago
Coarse graining in an evolutionary algorithm with recombination, duplication and inversion
A generalised form of recombination, wherein an offspring can be formed from any of the genetic material of the parents, is analysed in the context of a two-locus recombinative G...
Christopher R. Stephens, Riccardo Poli
APPROX
2005
Springer
105views Algorithms» more  APPROX 2005»
15 years 4 months ago
The Complexity of Making Unique Choices: Approximating 1-in- k SAT
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
Venkatesan Guruswami, Luca Trevisan
CP
2005
Springer
15 years 4 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
15 years 4 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
GD
2004
Springer
15 years 4 months ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg