Sciweavers

8437 search results - page 218 / 1688
» Preferences over Sets
Sort
View
PRICAI
1998
Springer
15 years 10 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
ICCBR
2010
Springer
15 years 10 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
SC
1995
ACM
15 years 10 months ago
Distributing a Chemical Process Optimization Application Over a Gigabit Network
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
Robert L. Clay, Peter Steenkiste
WSC
2007
15 years 8 months ago
Estimating the probability of a rare event over a finite time horizon
We study an approximation for the zero-variance change of measure to estimate the probability of a rare event in a continuous-time Markov chain. The rare event occurs when the cha...
Pieter-Tjerk de Boer, Pierre L'Ecuyer, Gerardo Rub...
DEBS
2008
ACM
15 years 8 months ago
Real-time, load-adaptive processing of continuous queries over data streams
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
Dhananjay Kulkarni, Chinya V. Ravishankar, Mitch C...