Sciweavers

1029 search results - page 45 / 206
» Compact representations of ordered sets
Sort
View
154
Voted
AAAI
2011
14 years 2 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
110
Voted
MICRO
1996
IEEE
106views Hardware» more  MICRO 1996»
15 years 6 months ago
Optimization of Machine Descriptions for Efficient Use
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
John C. Gyllenhaal, Wen-mei W. Hwu, B. Ramakrishna...
UAI
1998
15 years 4 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
137
Voted
ECP
1997
Springer
130views Robotics» more  ECP 1997»
15 years 6 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
144
Voted
EJC
2008
15 years 2 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen