5493 search results - page 6 / 1099 » Effectively Polynomial Simulations |
100
click to vote
AUTOMATICA
2008
15 years 23 days ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
116
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
49
Voted
WSC
2008
15 years 3 months ago
2008
46
Voted
WSC
2004
15 years 2 months ago
2004
43
Voted
CORR
2008
Springer
15 years 22 days ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...