16091 search results - page 29 / 3219 » Solving |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...