Sciweavers

1920 search results - page 6 / 384
» The Complexity of the A B C Problem
Sort
View
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
15 years 10 months ago
Grasp Analysis as Linear Matrix Inequality Problems
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 ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
INFORMS
2007
77views more  INFORMS 2007»
15 years 5 months ago
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin,...
IOR
2007
138views more  IOR 2007»
15 years 5 months ago
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
Ravindra K. Ahuja, Arvind Kumar, Krishna C. Jha, J...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 6 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
ICC
2007
IEEE
177views Communications» more  ICC 2007»
16 years 13 hour ago
IEEE 802.11b Complementary Code Keying and Complementary Signals Derived from Biorthogonal Sequences
—Two classes of complementary signal sets are compared in terms of their complementary properties and their error probabilities for channels with thermal noise and multipath inte...
Michael B. Pursley, Thomas C. Royster IV