44 search results - page 8 / 9 » Conquering Complexity |
GECCO
2006
Springer
14 years 6 days ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
AAAI
1990
13 years 9 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
To meet conflicting flexibility, performance and cost constraints of demanding signal processing applications, future designs in this domain will contain an increasing number of a...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
The proliferation of XML as a standard for data representation and exchange in diverse, next-generation Web applications has created an emphatic need for effective XML data-integr...