9842 search results - page 1788 / 1969 » Compositional timing analysis |
129
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
124
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
157
Voted
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
136
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
140
Voted
CD
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...