Sciweavers

1220 search results - page 86 / 244
» Minimal Interval Completions
Sort
View
JHSN
2000
92views more  JHSN 2000»
13 years 9 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
TROB
2002
138views more  TROB 2002»
13 years 8 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
DC
2010
13 years 5 months ago
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...
Seth Gilbert, Nancy A. Lynch, Alexander A. Shvarts...
BMCBI
2004
97views more  BMCBI 2004»
13 years 9 months ago
Global features of sequences of bacterial chromosomes, plasmids and phages revealed by analysis of oligonucleotide usage pattern
Background: Oligonucleotide frequencies were shown to be conserved signatures for bacterial genomes, however, the underlying constraints have yet not been resolved in detail. In t...
Oleg N. Reva, Burkhard Tümmler
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 9 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin