Sciweavers

2107 search results - page 159 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
129
Voted
JCNS
2010
86views more  JCNS 2010»
15 years 2 months ago
Reduced models for binocular rivalry
Binocular rivalry occurs when two very different images are presented to the two eyes, but a subject perceives only one image at a given time. A number of computational models for...
Carlo R. Laing, Thomas Frewen, Ioannis G. Kevrekid...
149
Voted
SPDP
1993
IEEE
15 years 7 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
121
Voted
EVOW
2004
Springer
15 years 9 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro
126
Voted
FOCS
2008
IEEE
15 years 10 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
106
Voted
HPCC
2007
Springer
15 years 9 months ago
Parallel Performance Prediction for Multigrid Codes on Distributed Memory Architectures
We propose a model for describing the parallel performance of multigrid software on distributed memory architectures. The goal of the model is to allow reliable predictions to be m...
Giuseppe Romanazzi, Peter K. Jimack