Sciweavers

837 search results - page 34 / 168
» Hard combinators
Sort
View
84
Voted
CSCLP
2004
Springer
15 years 3 months ago
Dynamic Distributed BackJumping
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
80
Voted
EVOW
2004
Springer
15 years 3 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta
86
Voted
IFIP
2004
Springer
15 years 3 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot
85
Voted
KBSE
2003
IEEE
15 years 3 months ago
Semi-Automatic Fault Localization and Behavior Verification for Physical System Simulation Models
Mathematical modeling and simulation of complex physical systems are emerging as key technologies in engineering. Modern approaches to physical system simulation allow users to sp...
Peter Bunus, Peter Fritzson
GECCO
2003
Springer
15 years 3 months ago
Chromosome Reuse in Genetic Algorithms
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
Adnan Acan, Yüce Tekol