173 search results - page 23 / 35 » random 1999 |
ISAAC
1999
Springer
14 years 2 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
COMPUTER
1999
13 years 9 months ago
1999
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
NN
2002
Springer
13 years 9 months ago
2002
Springer
In reinforcement learning (RL), the duality between exploitation and exploration has long been an important issue. This paper presents a new method that controls the balance betwe...
SIGECOM
2000
ACM
14 years 2 months ago
2000
ACM
Using data collected between August 1999 and January 2000, we examine firm-level pricing strategies for 32 online bookstores. The data cover more than 300 books, including New Yor...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...