Sciweavers

1578 search results - page 78 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Slick packets
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Mat...
ATAL
2005
Springer
14 years 2 months ago
An integrated token-based algorithm for scalable coordination
Efficient coordination among large numbers of heterogeneous agents promises to revolutionize the way in which some complex tasks, such as responding to urban disasters can be perf...
Yang Xu, Paul Scerri, Bin Yu, Steven Okamoto, Mich...
SIGGRAPH
1992
ACM
14 years 25 days ago
Predicting reflectance functions from complex surfaces
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
Stephen H. Westin, James Arvo, Kenneth E. Torrance
ICSE
1995
IEEE-ACM
14 years 9 days ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
GLOBECOM
2006
IEEE
14 years 2 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji