Sciweavers

2657 search results - page 210 / 532
» On the complexity of hierarchical problem solving
Sort
View
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 1 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
JAR
2006
106views more  JAR 2006»
15 years 1 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
TASE
2010
IEEE
14 years 8 months ago
Optimization of Group Elevator Scheduling With Advance Information
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
Jin Sun, Qianchuan Zhao, Peter B. Luh
ICCV
2007
IEEE
16 years 3 months ago
A Divide-and-Conquer Approach to 3D Object Reconstruction from Line Drawings
3D object reconstruction from a single 2D line drawing is an important problem in both computer vision and graphics. Many methods have been put forward to solve this problem, but ...
Yu Chen, Jianzhuang Liu, Xiaoou Tang
116
Voted
FCT
2003
Springer
15 years 7 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier