1986 search results - page 244 / 398 » Path Separability of Graphs |
129
click to vote
SIGCOMM
2004
ACM
15 years 9 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
118
Voted
DBPL
1993
Springer
15 years 7 months ago
1993
Springer
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments , an object-oriented data model at the core of a scient...
140
Voted
ICTAI
2000
IEEE
15 years 7 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
185
Voted
IJCAI
1989
15 years 4 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
152
click to vote
ICWE
2009
Springer
15 years 7 months ago
2009
Springer
The user observed latency of retrieving Web documents is one of
limiting factors while using the Internet as an information data source.
Prefetching became important technique ...