Sciweavers

526 search results - page 72 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
JMLR
2006
117views more  JMLR 2006»
15 years 4 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
ICTAI
2010
IEEE
15 years 2 months ago
A Closer Look at MOMDPs
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
Mauricio Araya-López, Vincent Thomas, Olivi...
135
Voted
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
15 years 7 months ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
150
Voted
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
13 years 6 months ago
Selecting a characteristic set of reviews
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
Theodoros Lappas, Mark Crovella, Evimaria Terzi
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 8 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein