Sciweavers

3991 search results - page 535 / 799
» Bounding homogeneous models
Sort
View
LCTRTS
2004
Springer
15 years 10 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
SAT
2004
Springer
97views Hardware» more  SAT 2004»
15 years 10 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
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 10 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 10 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...
VRST
2003
ACM
15 years 10 months ago
Partitioning crowded virtual environments
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
Anthony Steed, Roula Abou-Haidar