Sciweavers

1301 search results - page 249 / 261
» Bounded Version Vectors
Sort
View
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 9 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
ALIFE
2005
13 years 9 months ago
Transient Phenomena in Learning and Evolution: Genetic Assimilation and Genetic Redistribution
Deacon has recently proposed that complexes of genes can be integrated into functional groups as a result of environmental changes that mask and unmask selection pressures. For exa...
Janet Wiles, James Watson, Bradley Tonkes, Terrenc...
TCBB
2008
117views more  TCBB 2008»
13 years 9 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
IOR
2007
89views more  IOR 2007»
13 years 9 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...