Sciweavers

386 search results - page 46 / 78
» Fundamental Questions
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
PIMRC
2008
IEEE
14 years 4 months ago
Investigating the validity of IEEE 802.11 MAC modeling hypotheses
—As WLANs employing IEEE 802.11 have become pervasive, many analytic models for predicting their performance have been developed in recent years. Due to the complicated nature of...
K. D. Huang, Ken R. Duffy, David Malone, Douglas J...
IPPS
2007
IEEE
14 years 4 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...
IWPC
2007
IEEE
14 years 4 months ago
Empirical Evaluation of a UML Sequence Diagram with Adornments to Support Understanding of Thread Interactions
Programs that use multi-threaded concurrency are known to be difficult to design. Moreover, research in computer-science education suggests that concurrency and synchronization co...
Shaohua Xie, Eileen Kraemer, R. E. Kurt Stirewalt
PROVSEC
2007
Springer
14 years 4 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti