Sciweavers

564 search results - page 85 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
BMCBI
2010
96views more  BMCBI 2010»
14 years 9 months ago
QTLminer: identifying genes regulating quantitative traits
Background: Quantitative trait locus (QTL) mapping identifies genomic regions that likely contain genes regulating a quantitative trait. However, QTL regions may encompass tens to...
Rudi Alberts, Klaus Schughart
ICML
2003
IEEE
15 years 10 months ago
Q-Decomposition for Reinforcement Learning Agents
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
Stuart J. Russell, Andrew Zimdars
CADE
2005
Springer
15 years 10 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
LPAR
2007
Springer
15 years 3 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard