10493 search results - page 1837 / 2099 » Dynamic Word Problems |
131
Voted
ECP
1997
Springer
15 years 6 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
169
click to vote
SPDP
1996
IEEE
15 years 6 months ago
1996
IEEE
The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel mac...
100
Voted
FPL
1997
Springer
15 years 6 months ago
1997
Springer
Controllers for dynamically recon gurable FPGAs that are capable of supporting multiple independent tasks simultaneously need to be able to place designs at run{time when the seque...
114
click to vote
TIME
1994
IEEE
15 years 6 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
147
click to vote
CIAC
1994
Springer
15 years 6 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...