Sciweavers

7930 search results - page 335 / 1586
» Greedy in Approximation Algorithms
Sort
View
MDM
2004
Springer
154views Communications» more  MDM 2004»
16 years 1 days ago
On Bulk Loading TPR-Tree
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
Bin Lin, Jianwen Su
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
16 years 19 hour ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee
173
Voted
ICRA
2000
IEEE
93views Robotics» more  ICRA 2000»
15 years 11 months ago
Human Augmentation in Teleoperation of Arm Manipulators in an Environment with Obstacles
This paper discusses a novel approach to combining human and machine intelligence in teleoperation of 6 degree of freedom (DOF) arm manipulators. Two algorithms are presented that...
Igor Ivanisevic, Vladimir J. Lumelsky
SARA
2000
Springer
15 years 10 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
UAI
2004
15 years 8 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter