Sciweavers

94 search results - page 7 / 19
» Scalable Precomputed Search Trees
Sort
View
ICPP
2008
IEEE
14 years 1 months ago
Scalable Dynamic Load Balancing Using UPC
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
Stephen Olivier, Jan Prins
P2P
2002
IEEE
103views Communications» more  P2P 2002»
14 years 11 days ago
Towards a Hierarchical, Semantic Peer-to-Peer Topology
We propose a new p2p network topology that reduces bandwidth consumption and provides complete searches by employing a tree hierarchy of indexing nodes that facilitates the search...
Roman Kurmanowytsch, Mehdi Jazayeri, Engin Kirda
IJCAI
2003
13 years 8 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
AIPS
2008
13 years 9 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