537 search results - page 20 / 108 » A new upper bound for 3-SAT |
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
TMI
2010
13 years 6 months ago
2010
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
ICANN
1997
Springer
14 years 18 days ago
1997
Springer
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
CP
2011
Springer
12 years 8 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...