71 search results - page 9 / 15 » Polynomial time quantum algorithm for the computation of the... |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
SODA
1990
ACM
13 years 9 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
ALT
1995
Springer
13 years 12 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...