1310 search results - page 192 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
174
click to vote
DC
2010
15 years 5 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
155
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
: Time modulated antenna arrays attracted the attention of researchers for the synthesis of low/ultra-low side lobes in recent past. In this article we propose an improved variant ...
140
click to vote
PODC
2004
ACM
15 years 10 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
119
click to vote
DAC
2005
ACM
16 years 6 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
161
Voted
LCPC
1997
Springer
15 years 9 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...