Sciweavers

48 search results - page 10 / 10
» A dynamic programming approach to price installment options
Sort
View
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 5 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
JAIR
2006
157views more  JAIR 2006»
13 years 5 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
13 years 11 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve