Sciweavers

321 search results - page 9 / 65
» Relating complexity and precision in control flow analysis
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICALP
2000
Springer
13 years 11 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
DAC
2005
ACM
14 years 8 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
FSEN
2009
Springer
13 years 11 months ago
Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
Uli Fahrenberg, Kim G. Larsen, Claus R. Thrane
CDC
2009
IEEE
110views Control Systems» more  CDC 2009»
13 years 5 months ago
Perturbation analysis and optimization of multiclass multiobjective Stochastic Flow Models
Stochastic Flow Models (SFMs) are stochastic ystems that abstract the dynamics of complex discrete event systems involving the control of sharable resources. SFMs have been used to...
Chen Yao, Christos G. Cassandras