Sciweavers

10890 search results - page 2126 / 2178
» Automatic Complexity Analysis
Sort
View
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 9 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
AAAI
2006
13 years 9 months ago
Preference Elicitation and Generalized Additive Utility
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
Darius Braziunas, Craig Boutilier
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
AAAI
2006
13 years 9 months ago
Collective Construction Using Lego Robots
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
Crystal Schuil, Matthew Valente, Justin Werfel, Ra...
AIPS
2004
13 years 9 months ago
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
Dmitri A. Dolgov, Edmund H. Durfee
« Prev « First page 2126 / 2178 Last » Next »