1068 search results - page 119 / 214 » On Space Bounded Server Algorithms |
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
ICDT
2001
ACM
14 years 10 days ago
2001
ACM
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
SIGOPSE
2004
ACM
14 years 1 months ago
2004
ACM
Web application workloads are often characterized by a large number of unique read requests and a significant fraction of write requests. Hosting these applications drives the ne...
AISS
2010
13 years 5 months ago
2010
The node selection for the migration of a mobile agent depends on the content of the referenced metadata in the naming space. The reliability of the migrated information is determ...