Sciweavers

2562 search results - page 284 / 513
» Components of the Fundamental Category
Sort
View
ICFP
2004
ACM
16 years 6 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
MOBIHOC
2008
ACM
16 years 6 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
MOBIHOC
2002
ACM
16 years 6 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
POPL
2010
ACM
16 years 4 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
EUROSYS
2007
ACM
16 years 3 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer