Sciweavers

4403 search results - page 542 / 881
» Galois Theory of Algorithms
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 7 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
JAR
2006
236views more  JAR 2006»
15 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SIGIR
2008
ACM
15 years 7 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
261
Voted
ATAL
2011
Springer
14 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe