Sciweavers

455 search results - page 60 / 91
» Adaptive Sampling for Noisy Problems
Sort
View
AAAI
2011
12 years 7 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
GECCO
2006
Springer
169views Optimization» more  GECCO 2006»
13 years 11 months ago
An open-set speaker identification system using genetic learning classifier system
This paper presents the design and implementation of an adaptive open-set speaker identification system with genetic learning classifier systems. One of the challenging problems i...
WonKyung Park, Jae C. Oh, Misty K. Blowers, Matt B...
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
13 years 9 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 1 months ago
Finding interesting things
Model- and simulation-designers are often interested not in the optimum output of their system, but in understanding how the output is sensitive to different parameters. This can...
Sean Luke, Deepankar Sharma, Gabriel Catalin Balan
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
Prasad Chebolu, Mary Cryan, Russell A. Martin