2588 search results - page 47 / 518 » Applications of Kolmogorov complexity to computable model th... |
101
click to vote
ATAL
2006
Springer
15 years 3 months 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...
105
click to vote
SAG
2004
Springer
15 years 4 months ago
2004
Springer
Bioinformatics applications manage complex biological data stored into distributed and often heterogeneous databases and require large computing power. Among these, protein structu...
GECCO
2008
Springer
15 years 10 days ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
ECBS
2003
IEEE
15 years 4 months ago
2003
IEEE
Polymorphous computer-based systems are systems in which the CPU architecture “morphs” or changes shape to meet the requirements of the application. Optimized and efficient de...
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...