Sciweavers

828 search results - page 96 / 166
» Bounded Hairpin Completion
Sort
View
DM
2010
128views more  DM 2010»
13 years 10 months ago
Some remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
Mitre Costa Dourado, Fábio Protti, Dieter R...
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 10 months ago
How to Beat the Adaptive Multi-Armed Bandit
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
Varsha Dani, Thomas P. Hayes
CORR
2006
Springer
121views Education» more  CORR 2006»
13 years 10 months ago
On the Foundations of Universal Sequence Prediction
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which...
Marcus Hutter
FUIN
2006
105views more  FUIN 2006»
13 years 10 months ago
Spiking Neural P Systems
This paper is an attempt to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we cal...
Mihai Ionescu, Gheorghe Paun, Takashi Yokomori
JOC
2006
71views more  JOC 2006»
13 years 10 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...