1810 search results - page 249 / 362 » BASE: Using Abstraction to Improve Fault Tolerance |
184
click to vote
AAAI
2004
15 years 7 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
162
click to vote
WAE
2000
15 years 7 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
167
click to vote
TIT
1998
15 years 6 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
193
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Energy-efficient link adaptation is studied for transmission on a frequency-selective parallel AWGN channel. The total power dissipation model includes a circuit power th...
157
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...