6607 search results - page 478 / 1322 » Making TeX Work |
241
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
192
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
166
click to vote
EUROSYS
2008
ACM
16 years 3 months ago
2008
ACM
Programs written in type-unsafe languages such as C and C++ incur costly memory errors that result in corrupted data structures, program crashes, and incorrect results. We present...
153
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
179
click to vote
PLPV
2009
ACM
16 years 3 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...