540 search results - page 58 / 108 » Competitive Routing over Time |
123
Voted
AIPS
2010
15 years 4 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
130
click to vote
SODA
1990
ACM
15 years 3 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
186
Voted
SIGMETRICS
2000
ACM
15 years 1 months ago
2000
ACM
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
122
click to vote
IWSOS
2009
Springer
15 years 8 months ago
2009
Springer
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...
106
click to vote
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
Adaptive query processing schemes attempt to reoptimize query plans during the course of query execution. A variety of techniques for adaptive query processing have been proposed,...