2283 search results - page 198 / 457 » Bounds of Graph Characteristics |
99
Voted
SPAA
1990
ACM
15 years 7 months ago
1990
ACM
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
120
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
133
click to vote
DEDS
2010
15 years 3 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
116
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— We investigate two quantities of fundamental interest in a mobile ad-hoc network: the capacity region and the minimum energy function of the network. The capacity regio...
128
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes, for the FPGA-based embedded systems, a reliability-aware process scheduling strategy that operates under performance bounds. A unique characteristic of the pr...