Sciweavers

5055 search results - page 708 / 1011
» Relative Timing
Sort
View
SIGCOMM
1994
ACM
15 years 10 months ago
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an inno...
Charles E. Perkins, Pravin Bhagwat
VLDB
1994
ACM
119views Database» more  VLDB 1994»
15 years 10 months ago
Bulk Loading into an OODB: A Performance Study
Object-oriented database OODB users bring with them large quantities of legacy data megabytes and even gigabytes. In addition, scienti c OODB users continually generate new data. ...
Janet L. Wiener, Jeffrey F. Naughton
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 10 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
SIGGRAPH
1992
ACM
15 years 10 months ago
An importance-driven radiosity algorithm
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
Brian E. Smits, James Arvo, David Salesin
STOC
1992
ACM
122views Algorithms» more  STOC 1992»
15 years 10 months ago
Existence and Construction of Edge Disjoint Paths on Expander Graphs
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
Andrei Z. Broder, Alan M. Frieze, Eli Upfal