Sciweavers

828 search results - page 78 / 166
» Bounded Hairpin Completion
Sort
View
ESORICS
2000
Springer
14 years 1 months ago
A Full Bandwidth ATM Firewall
The ATM technology has been specified to provide users with the ability to request quality of service (QoS) for their applicatio ns and to enable high speed communications. Howeve...
Olivier Paul, Maryline Laurent, Sylvain Gombault
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
14 years 1 months ago
Distributed Cooperation During the Absence of Communication
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 2 days ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
WAE
2001
222views Algorithms» more  WAE 2001»
13 years 11 months ago
An Experimental Study of Data Migration Algorithms
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing u...
Eric J. Anderson, Joseph Hall, Jason D. Hartline, ...
NIPS
1998
13 years 11 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller