1380 search results - page 105 / 276 » Computing the optimal strategy to commit to |
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
SLP
1994
13 years 9 months ago
1994
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
FGCS
2000
13 years 7 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...