270 search results - page 20 / 54 » Exploiting Problem Structure for Solution Counting |
MICAI
2004
Springer
14 years 1 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we formulate the “generalized inverse kinematics problem” for a spatial serial chain, where the goal is to determine values for structural parameters as well ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
SIAMSC
2010
13 years 2 months ago
2010
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper introduces a convenient framework based on passivity and Linear Matrix Inequalities (LMIs) for stability analysis and controller design for haptic systems involving ...