Sciweavers

93 search results - page 14 / 19
» Large power grid analysis using domain decomposition
Sort
View
IJSEKE
2011
141views more  IJSEKE 2011»
12 years 12 months ago
Risk Assessment in Multi-disciplinary (Software+) Engineering Projects
Software systems in safety-critical industrial automation systems, such as power plants and steel mills, become increasingly large, complex, and distributed. For assessing risks, l...
Stefan Biffl, Thomas Moser, Dietmar Winkler
NIPS
2004
13 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
DAC
2005
ACM
13 years 10 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...
GIS
1995
ACM
13 years 12 months ago
Object-Oriented Requirements Engineering for GIS Applications
We stress the importance of requirements engineering (RE) for the development of large scale software in general and for GIS-applications in particular. RE analyses the problem do...
Georg Kösters, Bernd-Uwe Pagel, Hans-Werner S...
JAR
2000
123views more  JAR 2000»
13 years 8 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle