Sciweavers

9572 search results - page 330 / 1915
» Cover Algorithms and Their Combination
Sort
View
IJIT
2004
15 years 8 months ago
Synthesis of Logic Circuits Using Fractional-Order Dynamic Fitness Functions
This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuit...
Cecília Reis, José António Te...
WWW
2004
ACM
16 years 7 months ago
Ranking the web frontier
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into...
Nadav Eiron, Kevin S. McCurley, John A. Tomlin
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
16 years 3 days ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
MASCOTS
2010
15 years 8 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson
187
Voted
DAM
2010
81views more  DAM 2010»
15 years 6 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon