Sciweavers

13621 search results - page 276 / 2725
» Computability and Complexity in Self-assembly
Sort
View
IANDC
2006
83views more  IANDC 2006»
15 years 6 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
KI
2008
Springer
15 years 6 months ago
Learning by Observing: Case-Based Decision Making in Complex Strategy Games
Abstract. There is a growing research interest in the design of competitive and adaptive Game AI for complex computer strategy games. In this paper, we present a novel approach for...
Darko Obradovic, Armin Stahl
ENTCS
2007
98views more  ENTCS 2007»
15 years 6 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...
SIGMETRICS
2008
ACM
15 years 6 months ago
Synchronized network emulation: matching prototypes with complex simulations
Network emulation, in which real systems interact with a network simulation, is a common evaluation method in computer networking research. Until now, the simulation in charge of ...
Elias Weingärtner, Florian Schmidt, Tobias He...
AI
2005
Springer
15 years 6 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...