9842 search results - page 369 / 1969 » The Complexity of the Matching-Cut Problem |
164
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
127
click to vote
ICRA
1999
IEEE
15 years 8 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
140
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
135
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
140
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...