Sciweavers

739 search results - page 146 / 148
» Sorting Algorithms
Sort
View
EUROSYS
2009
ACM
13 years 11 months ago
Effective and efficient compromise recovery for weakly consistent replication
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
Prince Mahajan, Ramakrishna Kotla, Catherine C. Ma...
FPCA
1995
13 years 11 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
TREC
2004
13 years 8 months ago
Can We Get A Better Retrieval Function From Machine?
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
Weiguo Fan, Wensi Xi, Edward A. Fox, Li Wang
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
BMCBI
2010
112views more  BMCBI 2010»
13 years 7 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke