Sciweavers

17541 search results - page 3466 / 3509
» Complexity in scalable computing
Sort
View
AOR
2006
95views more  AOR 2006»
14 years 9 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
EOR
2008
106views more  EOR 2008»
14 years 9 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
BMCBI
2006
239views more  BMCBI 2006»
14 years 9 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
BMCBI
2006
108views more  BMCBI 2006»
14 years 9 months ago
An improved map of conserved regulatory sites for Saccharomyces cerevisiae
Background: The regulatory map of a genome consists of the binding sites for proteins that determine the transcription of nearby genes. An initial regulatory map for S. cerevisiae...
Kenzie D. MacIsaac, Ting Wang, D. Benjamin Gordon,...
GPEM
2008
128views more  GPEM 2008»
14 years 9 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
« Prev « First page 3466 / 3509 Last » Next »