Sciweavers

953 search results - page 14 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 9 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
EC
2008
116views ECommerce» more  EC 2008»
13 years 7 months ago
Efficient Evaluation Functions for Evolving Coordination
Abstract-- This paper presents a method for creating evaluation functions that efficiently promote coordination in a multiagent system, allowing single-agent evolutionary computati...
Adrian K. Agogino, Kagan Tumer
DSN
2006
IEEE
13 years 11 months ago
Efficient High Hamming Distance CRCs for Embedded Networks
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
Justin Ray, Philip Koopman
ICML
2008
IEEE
14 years 8 months ago
An object-oriented representation for efficient reinforcement learning
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
Carlos Diuk, Andre Cohen, Michael L. Littman
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu