633 search results - page 41 / 127 » Locality and Hard SAT-Instances |
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
− In a clustered, multi-hop sensor network, a large number of inexpensive, geographically-distributed sensor nodes each use their observations of the environment to make local ha...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
IJCAI
2001
13 years 11 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
ISHPC
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...