Sciweavers

246 search results - page 41 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
15 years 3 months ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
ATAL
2006
Springer
15 years 1 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
EVOW
2009
Springer
15 years 4 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
MSV
2004
14 years 11 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
APCSAC
2005
IEEE
15 years 3 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...