Sciweavers

6368 search results - page 1103 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
175
Voted
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
OTM
2005
Springer
15 years 11 months ago
Peer-to-Peer Distribution Architectures Providing Uniform Download Rates
Peer-to-peer (P2P) networks have proved to be a powerful and highly scalable alternative to traditional client-server architectures for content distribution. They offer the techni...
Marc Schiely, Pascal Felber
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 11 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
COLT
2004
Springer
15 years 11 months ago
Performance Guarantees for Regularized Maximum Entropy Density Estimation
Abstract. We consider the problem of estimating an unknown probability distribution from samples using the principle of maximum entropy (maxent). To alleviate overfitting with a v...
Miroslav Dudík, Steven J. Phillips, Robert ...
IPTPS
2004
Springer
15 years 11 months ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
« Prev « First page 1103 / 1274 Last » Next »