9532 search results - page 441 / 1907 » Logic, Graphs, and Algorithms |
161
click to vote
HICSS
1996
IEEE
15 years 11 months ago
1996
IEEE
Parallel simulation is expected to speed up simulation run time in a signi cant way. This paper describes a framework that is used to evaluate the performance of parallel simulati...
168
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper we propose three small instances of a reconfigurable circuit and analyze their properties using the brute force method and evolutionary algorithm. Although ...
177
click to vote
CDES
2006
15 years 8 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
144
Voted
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
164
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...