Sciweavers

9572 search results - page 410 / 1915
» Cover Algorithms and Their Combination
Sort
View
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
16 years 1 months ago
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
Magnus Lindhé, Petter Ögren, Karl Henr...
ISPAN
2005
IEEE
16 years 1 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
JSSPP
2004
Springer
16 years 29 days ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
CP
2003
Springer
16 years 25 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
FSTTCS
2001
Springer
16 years 2 days ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick