Sciweavers

1478 search results - page 98 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
ISSE
2006
13 years 9 months ago
Security Analysis and Configuration of Large Networks
Providing and managing security for large networked systems is difficult because their size and complexity makes manual design and management nearly impossible. Current security m...
Antonio Lioy
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 3 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
ANSOFT
2002
171views more  ANSOFT 2002»
13 years 9 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
SAS
2005
Springer
14 years 2 months ago
A Generic Framework for Interprocedural Analysis of Numerical Properties
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
Markus Müller-Olm, Helmut Seidl
WCE
2007
13 years 10 months ago
A Note on Tornado Diagrams in Interval Decision Analysis
—The research efforts of the DECIDE Research Group have resulted in a decision tool capable of handling imprecise information in complex decision situations. Some of the research...
Jim Idefeldt, Mats Danielson