1662 search results - page 205 / 333 » The Computational Complexity of Agent Design Problems |
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
AAAI
1996
13 years 10 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
DAC
2005
ACM
14 years 10 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...