1254 search results - page 23 / 251 » Making Hard Problems Harder |
131
click to vote
DCOSS
2008
Springer
15 years 2 months ago
2008
Springer
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
121
Voted
NFM
2011
14 years 7 months ago
2011
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
91
Voted
STOC
2007
ACM
16 years 24 days ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
94
Voted
ISHPC
1997
Springer
15 years 4 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...
159
Voted
SOICT
2010
14 years 7 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...