Sciweavers

4714 search results - page 615 / 943
» The Complexity of Iterated Multiplication
Sort
View
189
Voted
STTT
2011
195views more  STTT 2011»
15 years 1 months ago
Parallel probabilistic model checking on general purpose graphics processors
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski,...
EOR
2010
101views more  EOR 2010»
15 years 1 months ago
A linear implementation of PACMAN
PACMAN (Passive and Active Compensability Multicriteria ANalysis) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensabili...
Silvia Angilella, Alfio Giarlotta, Fabio Lamantia
PE
2010
Springer
132views Optimization» more  PE 2010»
15 years 1 months ago
Optimality analysis of energy-performance trade-off for server farm management
A central question in designing server farms today is how to efficiently provision the number of servers to extract the best performance under unpredictable demand patterns while ...
Anshul Gandhi, Varun Gupta, Mor Harchol-Balter, Mi...
PROMISE
2010
15 years 1 months ago
The relationship between search based software engineering and predictive modeling
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...
Mark Harman
TIT
2010
98views Education» more  TIT 2010»
15 years 1 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei