Sciweavers

471 search results - page 62 / 95
» Case studies for self-organization in computer science
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim

Publication
200views
15 years 7 months ago
Dynamic Queue Control Functions for ATM ABR Switch Schemes: Design and Analysis
The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady...
Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia Fahm...
CAV
2007
Springer
112views Hardware» more  CAV 2007»
14 years 3 months ago
Magnifying-Lens Abstraction for Markov Decision Processes
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
Luca de Alfaro, Pritam Roy
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
13 years 9 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
CF
2005
ACM
13 years 11 months ago
Grid result checking
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
Cécile Germain-Renaud, Dephine Monnier-Raga...