413 search results - page 66 / 83 » On Solving Geometric Optimization Problems Using Shortest Pa... |
CAD
2000
Springer
13 years 7 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
PARELEC
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
IANDC
2008
13 years 7 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...