Sciweavers

9842 search results - page 1846 / 1969
» Problem complexity
Sort
View
112
Voted
ICSE
2007
IEEE-ACM
16 years 23 days ago
Revel8or: Model Driven Capacity Planning Tool Suite
Designing complex multi-tier applications that must meet strict performance requirements is a challenging software engineering problem. Ideally, the application architect could de...
Liming Zhu, Yan Liu, Ngoc Bao Bui, Ian Gorton
LCPC
2007
Springer
15 years 6 months ago
Modeling Relations between Inputs and Dynamic Behavior for General Programs
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
Xipeng Shen, Feng Mao
CIDR
2003
106views Algorithms» more  CIDR 2003»
15 years 2 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
UAI
2007
15 years 1 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 1 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
« Prev « First page 1846 / 1969 Last » Next »