Sciweavers

5624 search results - page 999 / 1125
» On Conditional Covering Problem
Sort
View
CORR
2011
Springer
217views Education» more  CORR 2011»
13 years 6 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 6 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
One-Shot Capacity of Discrete Channels
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....
Rui A. Costa, Michael Langberg, João Barros
JCT
2011
104views more  JCT 2011»
13 years 6 months ago
Bounds for solid angles of lattices of rank three
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Lenny Fukshansky, Sinai Robins
DALT
2010
Springer
13 years 6 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos