1795 search results - page 33 / 359 » Search by strategy |
DAWAK
2005
Springer
15 years 3 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
CHI
2006
ACM
15 years 10 months ago
2006
ACM
Predicting visual search behavior in human-computer interaction is a challenging problem. It is important for predictive modeling of human-computer interaction to integrate the vi...
86
Voted
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...