Sciweavers

3172 search results - page 343 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CJ
2010
134views more  CJ 2010»
15 years 4 months ago
Designing Effective Policies for Minimal Agents
A policy for a minimal reactive agent is a set of condition-action rules used to determine its response to perceived environmental stimuli. When the policy pre-disposes the agent t...
Krysia Broda, Christopher J. Hogger
COMBINATORICA
2010
15 years 4 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
EMNLP
2010
15 years 4 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
ENTCS
2010
96views more  ENTCS 2010»
15 years 4 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
FUIN
2010
141views more  FUIN 2010»
15 years 4 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig