Sciweavers

595 search results - page 118 / 119
» Predictive State Representations with State Space Partitioni...
Sort
View
TIT
2002
95views more  TIT 2002»
13 years 4 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
BMCBI
2010
104views more  BMCBI 2010»
13 years 3 days ago
A systematic study of genome context methods: calibration, normalization and combination
Background: Genome context methods have been introduced in the last decade as automatic methods to predict functional relatedness between genes in a target genome using the patter...
Luciana Ferrer, Joseph M. Dale, Peter D. Karp
ATAL
2009
Springer
13 years 11 months ago
Abstraction in model checking multi-agent systems
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco ...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 10 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 9 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...