Sciweavers

4940 search results - page 170 / 988
» On the Complexity of Universal Programs
Sort
View
ICSE
2005
IEEE-ACM
16 years 5 months ago
An empirical evaluation of test case filtering techniques based on exercising complex information flows
Some software defects trigger failures only when certain complex information flows occur within the software. Profiling and analyzing such flows therefore provides a potentially i...
David Leon, Wes Masri, Andy Podgurski
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 11 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
15 years 11 months ago
Clustering Events on Streams Using Complex Context Information
Monitoring applications play an increasingly important role in many domains. They detect events in monitored systems and take actions such as invoke a program or notify an adminis...
YongChul Kwon, Wing Yee Lee, Magdalena Balazinska,...
CSL
2007
Springer
15 years 11 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
145
Voted
KR
2004
Springer
15 years 10 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang