Sciweavers

1290 search results - page 171 / 258
» New algorithms of the Q-learning type
Sort
View
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 2 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
ICDCS
2006
IEEE
14 years 2 months ago
Distributed Computing for Efficient Hyperspectral Imaging Using Fully Heterogeneous Networks of Workstations
Hyperspectral imaging is a new technique which has become increasingly important in many remote sensing applications, including automatic target recognition for military and defen...
Antonio Plaza, Javier Plaza, David Valencia
ICALP
2005
Springer
14 years 2 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
LAMAS
2005
Springer
14 years 2 months ago
Unifying Convergence and No-Regret in Multiagent Learning
We present a new multiagent learning algorithm, RVσ(t), that builds on an earlier version, ReDVaLeR . ReDVaLeR could guarantee (a) convergence to best response against stationary ...
Bikramjit Banerjee, Jing Peng
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez