2168 search results - page 247 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
156
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
191
click to vote
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
158
click to vote
CC
2012
Springer
14 years 7 days ago
2012
Springer
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
141
click to vote
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We wish to recover an image corrupted by blur and Gaussian or impulse noise, in a variational framework. We use two data-fidelity terms depending on the noise, and sever...
182
click to vote
ICFP
2001
ACM
16 years 4 months ago
2001
ACM
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...