2020 search results - page 8 / 404 » Speeding up Slicing |
NIPS
1993
13 years 8 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this ...
ASPDAC
1999
ACM
13 years 11 months ago
1999
ACM
We propose a new technique called node sampling to speed up the probability-based power estimation methods. It samples and processes only a small portion of total nodes to estimat...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
Mirror sites enable client requests to be serviced by any of a number of servers, reducing load at individual servers and dispersing network load. Typically, a client requests serv...