633 search results - page 16 / 127 » Locality and Hard SAT-Instances |
ESANN
2003
13 years 8 months ago
2003
This paper describes a two-stage system for the recognition ge meter values. A feed-forward Neural Abstraction Pyramid is initialized in an unsupervised manner and trained in a sup...
PRICAI
1998
Springer
13 years 11 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
AAAI
1994
13 years 8 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
EUROPAR
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
PERCOM
2010
ACM
13 years 5 months ago
2010
ACM
—The widespread use of tracking and localization systems may be hindered by centralized server platforms whose performance can hardly scale up to the needs of very large numbers ...