1677 search results - page 310 / 336 » On the Completeness of Quantum Computation Models |
110
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
120
click to vote
VLSID
2006
IEEE
15 years 7 months ago
2006
IEEE
This tutorial focuses on advanced techniques to cope with the complexity of designing modern digital chips which are complete systems often containing multiple processors, complex...
132
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
135
click to vote
EMSOFT
2004
Springer
15 years 6 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
113
click to vote
JELIA
2004
Springer
15 years 6 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...