Sciweavers

697 search results - page 89 / 140
» Improving EAs for Sequencing Problems
Sort
View
FLAIRS
2006
13 years 10 months ago
Dialog Learning in Conversational CBR
Conversational Case-Based Reasoning (CCBR) provides a mixed-initiative dialog for guiding users to refine their problem descriptions incrementally through a question-answering seq...
Mingyang Gu, Agnar Aamodt

Publication
154views
12 years 11 months ago
Preference elicitation and inverse reinforcement learning
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous w...
Constantin Rothkopf, Christos Dimitrakakis
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 9 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
14 years 3 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough