Sciweavers

1225 search results - page 150 / 245
» The Instance Complexity Conjecture
Sort
View
ISPASS
2007
IEEE
14 years 3 months ago
Accelerating Full-System Simulation through Characterizing and Predicting Operating System Performance
The ongoing trend of increasing computer hardware and software complexity has resulted in the increase in complexity and overheads of cycle-accurate processor system simulation, e...
Seongbeom Kim, Fang Liu, Yan Solihin, Ravi R. Iyer...
TAMC
2007
Springer
14 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
ICRE
2000
IEEE
14 years 1 months ago
Scenario Evolution: A Closer View on Relationships
In this article we show the results of an extensive research on scenario evolution. We investigated twelve case studies spanning over 200 scenarios that contained over 800 episode...
Karin Breitman, Julio Cesar Sampaio do Prado Leite
CCGRID
2008
IEEE
13 years 11 months ago
A Probabilistic Model to Analyse Workflow Performance on Production Grids
Production grids are complex and highly variable systems whose behavior is not well understood and difficult to anticipate. The goal of this study is to estimate the impact of the ...
Tristan Glatard, Johan Montagnat, Xavier Pennec