Sciweavers

3820 search results - page 496 / 764
» Bounded Model Debugging
Sort
View
139
Voted
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
114
Voted
LCTRTS
2004
Springer
15 years 8 months ago
Flattening statecharts without explosions
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
Andrzej Wasowski
89
Voted
SAT
2004
Springer
97views Hardware» more  SAT 2004»
15 years 8 months ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini
111
Voted
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 8 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee
NCA
2003
IEEE
15 years 8 months ago
A Study of Providing Statistical QoS in a Differentiated Sevices Network
In this paper, we propose and analyze a methodology for providing statistical guarantees within the diffserv model in a network, that uses static-priority schedulers. We extend th...
Shengquan Wang, Dong Xuan, Riccardo Bettati, Wei Z...