Sciweavers

1242 search results - page 118 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
AAAI
2010
15 years 7 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
ACTA
2007
96views more  ACTA 2007»
15 years 6 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
AMAI
2006
Springer
15 years 6 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
APIN
2002
80views more  APIN 2002»
15 years 6 months ago
Searching a Scalable Approach to Cerebellar Based Control
Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore...
Jan Peters, P. Patrick van der Smagt
TCS
2010
15 years 4 months ago
Analyzing the dynamics of stigmergetic interactions through pheromone games
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
Peter Vrancx, Katja Verbeeck, Ann Nowé