1449 search results - page 238 / 290 » Self-Randomized Exponentiation Algorithms |
160
click to vote
FOCS
2007
IEEE
16 years 10 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
176
click to vote
GLOBECOM
2007
IEEE
16 years 10 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
148
click to vote
ICCCN
2007
IEEE
16 years 9 days ago
2007
IEEE
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
137
click to vote
ATAL
2007
Springer
16 years 5 days ago
2007
Springer
In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA , that exploi...
178
click to vote
ATAL
2007
Springer
16 years 5 days ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...