524 search results - page 82 / 105 » Temporal reachability graphs |
169
Voted
LOGCOM
1998
15 years 3 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
232
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
140
Voted
P2P
2009
IEEE
15 years 10 months ago
2009
IEEE
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
116
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
147
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...