Sciweavers

10608 search results - page 1651 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
16 years 7 days ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
16 years 6 days ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
16 years 6 days ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
SPAA
2006
ACM
16 years 6 days ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
16 years 6 days ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
« Prev « First page 1651 / 2122 Last » Next »