Sciweavers

447 search results - page 76 / 90
» Decision trees with minimal costs
Sort
View
ICML
2006
IEEE
14 years 9 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 9 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
VLDB
2007
ACM
91views Database» more  VLDB 2007»
14 years 9 months ago
On Dominating Your Neighborhood Profitably
Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be domina...
Cuiping Li, Anthony K. H. Tung, Wen Jin, Martin Es...
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
14 years 5 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
DSOM
2009
Springer
14 years 3 months ago
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
Rendering networks and distributed systems self-managing and self-optimizing has become a major research focus. This task is especially important for systems, such as publish/subsc...
Arnd Schröter, Daniel Graff, Gero Mühl, ...