1402 search results - page 152 / 281 » Sparse-Memory Graph Search |
107
Voted
FOGA
2007
15 years 3 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de�...
134
click to vote
CODES
2001
IEEE
15 years 6 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
144
Voted
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
141
click to vote
IJAHUC
2008
15 years 2 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
111
click to vote
CEAS
2008
Springer
15 years 4 months ago
2008
Springer
We consider activity-centered tasks in email, including the novel task of predicting future involvement of persons from an enterprise in an ongoing activity represented by a folde...