Sciweavers

1380 search results - page 138 / 276
» Computing the optimal strategy to commit to
Sort
View
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
14 years 16 hour ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
FSTTCS
2008
Springer
13 years 9 months ago
Solvency Games
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...
Noam Berger, Nevin Kapur, Leonard J. Schulman, Vij...
BMCBI
2008
121views more  BMCBI 2008»
13 years 8 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
JAIR
2008
138views more  JAIR 2008»
13 years 8 months ago
Networks of Influence Diagrams: A Formalism for Representing Agents' Beliefs and Decision-Making Processes
This paper presents Networks of Influence Diagrams (NID), a compact, natural and highly expressive language for reasoning about agents' beliefs and decision-making processes....
Ya'akov Gal, Avi Pfeffer
FOGA
2011
12 years 11 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...