2899 search results - page 502 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
131
click to vote
BIBE
2004
IEEE
15 years 5 months ago
2004
IEEE
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
121
click to vote
FOCS
2008
IEEE
15 years 1 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
126
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
124
click to vote
TCAD
2008
15 years 1 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...