Sciweavers

683 search results - page 77 / 137
» Driver Destination Models
Sort
View
EUROPAR
2001
Springer
15 years 2 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
15 years 2 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
CVPR
1998
IEEE
15 years 2 months ago
Curves Matching Using Geodesic Paths
We present a method for matching curves which accommodates large and small deformation. The method preserves geometric similarities in the case of small deformation, and loosens t...
Isaac Cohen, Isabelle Herlin
VRML
1998
ACM
15 years 2 months ago
Event Processing for Complicated Routes in VRML 2.0
VRML 2.0 allows a content creator to dynamically control state changes in a virtual reality world by defining routes of events over VRML 2.0 nodes. In the conceptual execution mod...
Masaaki Taniguchi
IPPS
1994
IEEE
15 years 1 months ago
All-to-All Communication on Meshes with Wormhole Routing
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, ...
Rajeev Thakur, Alok N. Choudhary