Sciweavers

9842 search results - page 227 / 1969
» Problem complexity
Sort
View
EOR
2007
84views more  EOR 2007»
15 years 2 months ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux
134
Voted
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
125
Voted
MP
2008
129views more  MP 2008»
15 years 2 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
115
Voted
ICCBR
2009
Springer
15 years 7 months ago
Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
Samad Valipour Shokouhi, Agnar Aamodt, Pål S...
112
Voted
IEEECIT
2010
IEEE
15 years 1 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan