Sciweavers

1940 search results - page 251 / 388
» Optimizing search engines using clickthrough data
Sort
View
IPPS
1997
IEEE
15 years 9 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
GECCO
2009
Springer
163views Optimization» more  GECCO 2009»
15 years 11 months ago
Dealing with inheritance in OO evolutionary testing
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
Javier Ferrer, J. Francisco Chicano, Enrique Alba
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 10 months ago
The molecule evoluator: an interactive evolutionary algorithm for designing drug molecules
To help chemists design new drugs, we created a tool that uses interactive evolution to design drug molecules, the “Molecule Evoluator”. In contrast to most other evolutionary...
Eric-Wubbo Lameijer, Adriaan P. IJzerman, Joost N....
IPPS
2007
IEEE
15 years 11 months ago
Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
Due to the complexity associated with developing parallel applications, scientists and engineers rely on highlevel software libraries such as PETSc, ScaLAPACK and PESSL to ease th...
Pavan Balaji, Darius Buntinas, Satish Balay, Barry...
CODES
2007
IEEE
15 years 11 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling