Sciweavers

4171 search results - page 634 / 835
» Choice numbers of graphs
Sort
View
INFOCOM
2006
IEEE
16 years 18 days ago
Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Rep
— This paper investigates theoretical aspects of the uneven energy depletion phenomenon recently noticed in sink-based wireless sensor networks. We consider uniformly distributed...
Stephan Olariu, Ivan Stojmenovic
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
16 years 2 days ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
IPPS
2003
IEEE
15 years 12 months ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
ISESE
2002
IEEE
15 years 11 months ago
The Appropriateness of Gutman's Means-End Chain Model in Software Evaluation
The primary objective of this paper was to examine the extent to which Gutman’s Means-End Chain Model can be used to describe the influences given to the choice of characteristi...
Bernard Wong
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund