3082 search results - page 315 / 617 » New Bounds for the Controller Problem |
154
click to vote
JAR
2000
15 years 6 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
183
click to vote
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
165
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
215
click to vote
MP
2011
15 years 1 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...