Abstract -_The evolution of a heterogeneousteam behavior can he a very demanding task. In order to promote the greatest level of specialization team members should be evolved in se...
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
The problem of repair and maintenance of complex systems, such as aircraft, cars and trucks is certainly a nontrivial task. Maintenance technicians must use a great amount of knowl...
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...