14548 search results - page 2697 / 2910 » The Optimal Path-Matching Problem |
165
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
135
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
170
click to vote
VISUALIZATION
1998
IEEE
15 years 10 months ago
1998
IEEE
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address...
166
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
196
click to vote
AMET
1998
Springer
15 years 10 months ago
1998
Springer
We present an approach to the bid-evaluation problem in a system for multi-agent contract negotiation, called MAGNET. The MAGNET market infrastructure provides support for a variet...