14548 search results - page 335 / 2910 » The Optimal Path-Matching Problem |
178
click to vote
ISAAC
1998
Springer
15 years 11 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
197
click to vote
PVM
1998
Springer
15 years 11 months ago
1998
Springer
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
191
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
160
click to vote
CCCG
2004
15 years 8 months ago
2004
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
166
click to vote
ISCAS
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...