2767 search results - page 298 / 554 » Universal Exponentiation Algorithm |
109
Voted
ICCCN
2007
IEEE
15 years 9 months 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...
101
Voted
ATAL
2007
Springer
15 years 8 months 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...
140
Voted
ATAL
2007
Springer
15 years 8 months 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...
116
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
117
Voted
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....