2266 search results - page 98 / 454 » Some Solutions to the Ignoring Problem |
118
click to vote
DAWAK
2001
Springer
15 years 6 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
111
click to vote
DSN
2007
IEEE
15 years 5 months ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
113
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
116
click to vote
AIPS
2008
15 years 3 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
MOC
1998
15 years 1 months ago
1998
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...