Sciweavers

1258 search results - page 28 / 252
» Architecture-driven Problem Decomposition
Sort
View
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 2 days ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ICRA
2008
IEEE
157views Robotics» more  ICRA 2008»
14 years 3 months ago
Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
JACM
2007
115views more  JACM 2007»
13 years 8 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
CPAIOR
2010
Springer
14 years 1 days ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
IJCAI
1993
13 years 10 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe