Sciweavers

3889 search results - page 417 / 778
» A Framework for Optimizing Paper Matching
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Genetic evolution of hierarchical behavior structures
The development of coherent and dynamic behaviors for mobile robots is an exceedingly complex endeavor ruled by task objectives, environmental dynamics and the interactions within...
Brian G. Woolley, Gilbert L. Peterson
PVLDB
2010
179views more  PVLDB 2010»
15 years 5 months ago
MRShare: Sharing Across Multiple Queries in MapReduce
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra...
TPDS
2010
135views more  TPDS 2010»
15 years 5 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
POPL
2011
ACM
14 years 9 months ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 7 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera