Sciweavers

1654 search results - page 279 / 331
» Comparing Two Software Design Process Theories
Sort
View
PPOPP
2009
ACM
15 years 10 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
MOBIHOC
2009
ACM
15 years 10 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
SIGCSE
2004
ACM
141views Education» more  SIGCSE 2004»
15 years 3 months ago
Running on the bare metal with GeekOS
Undergraduate operating systems courses are generally taught e of two approaches: abstract or concrete. In the approach, students learn the concepts underlying operating systems t...
David Hovemeyer, Jeffrey K. Hollingsworth, Bobby B...
DOCENG
2008
ACM
14 years 12 months ago
An exploratory mapping strategy for web-driven magazines
"There will always (I hope) be print books, but just as the advent of photography changed the role of painting or film changed the role of theater in our culture, electronic ...
Fabio Giannetti
INFOCOM
2009
IEEE
15 years 4 months ago
Minimizing Delay for Multicast-Streaming in Wireless Networks with Network Coding
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
Wai-Leong Yeow, Anh Tuan Hoang, Chen-Khong Tham