Sciweavers

2402 search results - page 444 / 481
» Performance Analysis of a Distributed Question Answering Sys...
Sort
View
PPOPP
2010
ACM
15 years 9 months ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 6 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
NIPS
2004
15 years 1 months ago
Confidence Intervals for the Area Under the ROC Curve
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Corinna Cortes, Mehryar Mohri
KES
1999
Springer
15 years 4 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
PPOPP
2010
ACM
14 years 10 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...