2168 search results - page 77 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
139
Voted
IFIP
2005
Springer
15 years 9 months ago
2005
Springer
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
148
click to vote
IWMM
2010
Springer
15 years 8 months ago
2010
Springer
With the availability of chip multiprocessor (CMP) and simultaneous multithreading (SMT) machines, extracting thread level parallelism from a sequential program has become crucial...
143
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
140
Voted
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
132
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...