10901 search results - page 292 / 2181 » Approximations in Distributed Optimization |
191
click to vote
WG
2007
Springer
16 years 23 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
186
click to vote
JSA
2007
15 years 6 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
182
click to vote
KR
2004
Springer
16 years 19 hour ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
153
click to vote
DAM
2006
15 years 6 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
146
click to vote
CAGD
2007
15 years 6 months ago
2007
In this paper, geometric interpolation of certain circle-like curves by parametric polynomial curves is studied. It is shown that such an interpolating curve of degree n achieves ...