Sciweavers

803 search results - page 81 / 161
» Independence in Direct-Product Graphs
Sort
View
116
Voted
IPPS
2006
IEEE
15 years 6 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
AIPS
2000
15 years 2 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
92
Voted
DM
2006
135views more  DM 2006»
15 years 24 days ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman
73
Voted
SIAMDM
2010
87views more  SIAMDM 2010»
14 years 7 months ago
On 3-Hypergraphs with Forbidden 4-Vertex Configurations
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
Alexander A. Razborov
PODC
2005
ACM
15 years 6 months ago
On the locality of bounded growth
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...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer