69 search results - page 3 / 14 » Experimental Evaluation of the Greedy and Random Algorithms ... |
SODA
1998
ACM
13 years 7 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
DCOSS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ISCI
2008
13 years 5 months ago
2008
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 rand...
SIGIR
2008
ACM
13 years 5 months ago
2008
ACM
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
JPDC
2008
13 years 5 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...