Sciweavers

16504 search results - page 284 / 3301
» New Problems, New Solutions
Sort
View
EVOW
2003
Springer
15 years 12 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
15 years 10 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg
KES
2005
Springer
16 years 5 days ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
SIGOPSE
2004
ACM
16 years 2 days ago
Open problems in data collection networks
Research in sensor networks, continuous queries (CQ), and other domains has been motivated by powerful applications that aim to aggregate, assimilate, and interact with scores of ...
Jonathan Ledlie, Jeffrey Shneidman, Matt Welsh, Me...
SIAMSC
2008
165views more  SIAMSC 2008»
15 years 6 months ago
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
Kristian Bredies, Dirk A. Lorenz