Sciweavers

2294 search results - page 338 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
SAC
2003
ACM
14 years 2 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
ATAL
2003
Springer
14 years 2 months ago
Searching social networks
A referral system is a multiagent system whose member agents are capable of giving and following referrals. The specific cases of interest arise where each agent has a user. The ...
Bin Yu, Munindar P. Singh
FPL
2009
Springer
86views Hardware» more  FPL 2009»
14 years 1 months ago
Improving logic density through synthesis-inspired architecture
We leverage properties of the logic synthesis netlist to define both a logic element architecture and an associated technology mapping algorithm that together provide improved lo...
Jason Helge Anderson, Qiang Wang
ESOP
2001
Springer
14 years 1 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
VLSID
2000
IEEE
90views VLSI» more  VLSID 2000»
14 years 1 months ago
Performance Analysis of Systems with Multi-Channel Communication Architectures
This paper presents a novel system performance analysis technique to support the design of custom communication architectures for System-on-Chip ICs. Our technique fills a gap in...
Kanishka Lahiri, Sujit Dey, Anand Raghunathan