Sciweavers

707 search results - page 119 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
FLAIRS
2008
14 years 17 days ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 10 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
AIPS
2009
13 years 11 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
CGO
2011
IEEE
13 years 2 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
ACSAC
2009
IEEE
14 years 5 months ago
Detecting Software Theft via System Call Based Birthmarks
—Along with the burst of open source projects, software theft (or plagiarism) has become a very serious threat to the healthiness of software industry. Software birthmark, which ...
Xinran Wang, Yoon-chan Jhi, Sencun Zhu, Peng Liu