2168 search results - page 18 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
SIGUCCS
2003
ACM
14 years 27 days ago
2003
ACM
Rapid product or service deployment is most commonly thought of in the corporate, rather than academic, environment. Utilizing a rapid deployment process and a number of highly de...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
CG
2006
Springer
13 years 7 months ago
2006
Springer
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
ITCC
2003
IEEE
14 years 28 days ago
2003
IEEE
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...