Sciweavers

1554 search results - page 18 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
122
Voted
CAD
2006
Springer
15 years 2 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
DISOPT
2006
155views more  DISOPT 2006»
15 years 2 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
123
Voted
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 9 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
CEC
2007
IEEE
15 years 8 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
4OR
2008
56views more  4OR 2008»
15 years 2 months ago
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz