Sciweavers

1986 search results - page 389 / 398
» Path Separability of Graphs
Sort
View
SAC
2003
ACM
14 years 22 days 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 22 days 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
INFOCOM
2002
IEEE
14 years 12 days ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
14 years 9 days ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
FPL
2009
Springer
86views Hardware» more  FPL 2009»
14 years 3 days 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