Sciweavers

198 search results - page 18 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
APBC
2004
173views Bioinformatics» more  APBC 2004»
13 years 9 months ago
RNA Secondary Structure Prediction with Simple Pseudoknots
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
Jitender S. Deogun, Ruben Donts, Olga Komina, Fang...
ICML
2009
IEEE
14 years 9 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
ECML
2007
Springer
14 years 2 months ago
Nondeterministic Discretization of Weights Improves Accuracy of Neural Networks
Abstract. The paper investigates modification of backpropagation algorithm, consisting of discretization of neural network weights after each training cycle. This modification, a...
Marcin Wojnarski
MFCS
2005
Springer
14 years 1 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 1 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...