Sciweavers

1332 search results - page 243 / 267
» Combinatorial Algorithms
Sort
View
BMCBI
2006
138views more  BMCBI 2006»
13 years 7 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
IJAC
2006
93views more  IJAC 2006»
13 years 7 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
ILP
2004
Springer
14 years 1 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
COMSWARE
2007
IEEE
13 years 11 months ago
On Configuring BGP Route Reflectors
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta...