Sciweavers

217 search results - page 29 / 44
» An improved dynamic programming algorithm for coalition stru...
Sort
View
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
EVOW
2005
Springer
14 years 1 months ago
Convergence Synthesis of Dynamic Frequency Modulation Tones Using an Evolution Strategy
This paper reports on steps that have been taken to enhance previously presented evolutionary sound matching work. In doing so, the convergence characteristics are shown to provide...
Thomas J. Mitchell, Anthony G. Pipe
AMAI
2008
Springer
13 years 7 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 5 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
BIBE
2007
IEEE
108views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
On the Design of Oligos for Gene Synthesis
— Methods for reliable synthesis of long genes offer great promise for protein synthesis via expression of synthetic genes, with applications to improved analysis of protein stru...
Chris Thachuk, Anne Condon