3265 search results - page 204 / 653 » Representing Groups on Graphs |
137
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic whic...
119
click to vote
ISCIS
2004
Springer
15 years 9 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
123
click to vote
ASPDAC
2000
ACM
15 years 8 months ago
2000
ACM
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
148
click to vote
EDBTW
2006
Springer
15 years 6 months ago
2006
Springer
The information infrastructure in today's businesses consists of many interoperating autonomous systems. Changes to a single system can therefore have an unexpected impact on ...
143
click to vote
FAW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...