Sciweavers

6202 search results - page 220 / 1241
» Without Loss of Generality
Sort
View
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 5 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
IPM
2006
83views more  IPM 2006»
15 years 5 months ago
A risk minimization framework for information retrieval
This paper presents a probabilistic information retrieval framework in which the retrieval problem is formally treated as a statistical decision problem. In this framework, querie...
ChengXiang Zhai, John D. Lafferty
EOR
2007
98views more  EOR 2007»
15 years 5 months ago
Location of terror response facilities: A game between state and terrorist
We study a leader follower game with two players: a terrorist and a state where the later one installs facilities that provide support in case of a terrorist attack. While the Ter...
Oded Berman, Arieh Gavious
QUESTA
2006
115views more  QUESTA 2006»
15 years 5 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia
TWC
2008
120views more  TWC 2008»
15 years 5 months ago
Reliable Multi-hop Routing with Cooperative Transmissions in Energy-Constrained Networks
We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regi...
Aylin Aksu, Özgür Erçetin