Sciweavers

2899 search results - page 289 / 580
» Dynamic Trees in Practice
Sort
View
AIPS
2008
15 years 6 months ago
Planning for Modular Printers: Beyond Productivity
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
Minh Binh Do, Wheeler Ruml, Rong Zhou
WAE
2001
281views Algorithms» more  WAE 2001»
15 years 5 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
SI3D
2005
ACM
15 years 10 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 10 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng