112 search results - page 10 / 23 » Computational Complexity, Genetic Programming, and Implicati... |
AGP
1996
IEEE
14 years 18 days ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
GECCO
2000
Springer
14 years 19 hour ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
BMCBI
2007
13 years 8 months ago
2007
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
GECCO
2006
Springer
14 years 2 days ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
ATAL
2006
Springer
14 years 5 days ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...