Sciweavers

109 search results - page 15 / 22
» Classifier Combining Rules Under Independence Assumptions
Sort
View
PODS
2010
ACM
184views Database» more  PODS 2010»
13 years 11 months ago
Universally optimal privacy mechanisms for minimax agents
A scheme that publishes aggregate information about sensitive data must resolve the trade-off between utility to information consumers and privacy of the database participants. D...
Mangesh Gupte, Mukund Sundararajan
WRLA
2010
13 years 5 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
Francisco Durán, José Meseguer
JAIR
2007
111views more  JAIR 2007»
13 years 6 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
13 years 10 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
COLT
1992
Springer
13 years 10 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani