Sciweavers

1578 search results - page 137 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICFP
2001
ACM
14 years 10 months ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
13 years 11 months ago
The micro-genetic operator in the search of global trends
This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...
Flávio V. C. Martins, Eduardo G. Carrano, E...
NAS
2007
IEEE
14 years 4 months ago
Performance Evaluation of A Load Self-Balancing Method for Heterogeneous Metadata Server Cluster Using Trace-Driven and Syntheti
In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term l...
Bin Cai, Changsheng Xie, Guangxi Zhu
JCO
2007
123views more  JCO 2007»
13 years 10 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
INFOCOM
2000
IEEE
14 years 2 months ago
Stochastic Modeling of TCP over Lossy Links
—An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented. A Markovian approach is developed that allows us...
Alhussein A. Abouzeid, Sumit Roy, Murat Azizoglu