633 search results - page 16 / 127 » Locality and Hard SAT-Instances |
86
Voted
ESANN
2003
15 years 3 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...
141
click to vote
PRICAI
1998
Springer
15 years 6 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...
87
Voted
AAAI
1994
15 years 3 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...
109
Voted
EUROPAR
2004
Springer
15 years 7 months 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...
130
click to vote
PERCOM
2010
ACM
15 years 9 days 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 ...