Sciweavers

328 search results - page 37 / 66
» Simple Termination Revisited
Sort
View
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 7 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
BROADNETS
2007
IEEE
14 years 2 months ago
Modeling and analysis of worm interactions (war of the worms)
—“War of the worms” is a war between opposing computer worms, creating complex worm interactions as well as detrimental impact on infrastructure. For example, in September 20...
Sapon Tanachaiwiwat, Ahmed Helmy
APLAS
2005
ACM
14 years 1 months ago
Calculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
Hugh Anderson, Siau-Cheng Khoo, Stefan Andrei, Bea...