539 search results - page 39 / 108 » An Improved Upper Bound for SAT |
ALGORITHMICA
2004
13 years 7 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
ISPD
2003
ACM
14 years 24 days ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
COMPGEOM
2009
ACM
14 years 7 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
EJC
2008
13 years 7 months ago
2008
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...