3875 search results - page 148 / 775 » Approximation algorithms for the 0-extension problem |
145
click to vote
TALG
2010
15 years 3 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
136
click to vote
WAE
2000
15 years 6 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
146
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 4 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
120
Voted
NHM
2010
14 years 11 months ago
2010
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
148
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...