Sciweavers

518 search results - page 53 / 104
» Beating a Random Assignment
Sort
View
136
Voted
UAI
2004
15 years 3 months ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper
100
Voted
AAAI
1996
15 years 3 months ago
A Clinician's Tool for Analyzing Non-Compliance
We describe a computer program to assist a clinician with assessing the e cacy of treatments in experimental studies for which treatment assignment is random but subject complianc...
David Maxwell Chickering, Judea Pearl
AAAI
1994
15 years 3 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 2 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
126
Voted
JCP
2007
148views more  JCP 2007»
15 years 2 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy