507 search results - page 75 / 102 » Sizes of Ordered Decision Trees |
HIPEAC
2005
Springer
14 years 1 months ago
2005
Springer
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when ...
AIPS
2008
13 years 10 months ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...
JCM
2010
13 years 6 months ago
2010
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
SGAI
2009
Springer
14 years 2 months ago
2009
Springer
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
ICW
2005
IEEE
14 years 1 months ago
2005
IEEE
Most sensor network applications require quality of service guarantees on a network-wide basis, suggesting the need for global network cost optimization. The dynamic and nonunifor...