Sciweavers

2144 search results - page 376 / 429
» Exact Flow Analysis
Sort
View
MST
2010
98views more  MST 2010»
15 years 2 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 2 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
QUESTA
2010
131views more  QUESTA 2010»
15 years 2 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
SJ
2010
133views more  SJ 2010»
15 years 2 months ago
Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches
—With the rapid increase of real-time applications, jitter, delay, and throughput have become the three important QoS criteria in the scheduling of input-queued (IQ) switches wit...
Jingjing Zhang, Nirwan Ansari, Yaohui Jin, Weishen...
ACSD
2010
IEEE
224views Hardware» more  ACSD 2010»
15 years 2 months ago
Robustness of Sequential Circuits
Digital components play a central role in the design of complex embedded systems. These components are interconnected with other, possibly analog, devices and the physical environm...
Laurent Doyen, Thomas A. Henzinger, Axel Legay, De...