Sciweavers

16430 search results - page 631 / 3286
» On Computable Tree Functions
Sort
View
BMCBI
2007
107views more  BMCBI 2007»
15 years 7 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
EC
2008
116views ECommerce» more  EC 2008»
15 years 7 months ago
Efficient Evaluation Functions for Evolving Coordination
Abstract-- This paper presents a method for creating evaluation functions that efficiently promote coordination in a multiagent system, allowing single-agent evolutionary computati...
Adrian K. Agogino, Kagan Tumer
DAC
2001
ACM
16 years 8 months ago
An Algorithm for Bi-Decomposition of Logic Functions
We propose a new BDD-based method for decomposition of multi-output incompletely specified logic functions into netlists of two-input logic gates. The algorithm uses the internal ...
Alan Mishchenko, Bernd Steinbach, Marek A. Perkows...
POPL
2005
ACM
16 years 7 months ago
A probabilistic language based upon sampling functions
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primit...
Sungwoo Park, Frank Pfenning, Sebastian Thrun
ICALP
2009
Springer
16 years 7 months ago
The Theory of Stabilisation Monoids and Regular Cost Functions
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
Thomas Colcombet