973 search results - page 17 / 195 » New Bounds on Crossing Numbers |
IPL
2008
13 years 7 months ago
2008
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
AAAI
2006
13 years 8 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
BMCBI
2005
13 years 7 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...