1529 search results - page 98 / 306 » Search Space Analysis of the Linear Ordering Problem |
136
Voted
ER
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
SIAMSC
2008
15 years 4 months ago
2008
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
147
click to vote
CCCG
2008
15 years 5 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
119
click to vote
IJCAI
1997
15 years 5 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
170
click to vote
SIAMREV
2010
14 years 10 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...