Sciweavers

3356 search results - page 124 / 672
» Determining Consensus Numbers
Sort
View
ISIM
2007
13 years 11 months ago
Notes on Restricted P Colonies
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
Lucie Ciencialová, Ludek Cienciala
AI
2008
Springer
13 years 10 months ago
Understanding the role of noise in stochastic local search: Analysis and experiments
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
Ole J. Mengshoel
BMCBI
2008
68views more  BMCBI 2008»
13 years 10 months ago
NullHap - a versatile application to estimate haplotype frequencies from unphased genotypes in the presence of null alleles
Background: Laboratory techniques used to determine haplotypes are often too expensive for large-scale studies and lack of phase information is commonly overcome using likelihood-...
Robert M. Nowak, Rafal Ploski
CPC
2007
76views more  CPC 2007»
13 years 10 months ago
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Pet...
DAM
2007
103views more  DAM 2007»
13 years 10 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott