Sciweavers

344 search results - page 31 / 69
» The Directed Minimum Latency Problem
Sort
View
APPROX
2004
Springer
180views Algorithms» more  APPROX 2004»
15 years 5 months ago
A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
Markus Bläser
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 1 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
MICRO
2003
IEEE
70views Hardware» more  MICRO 2003»
15 years 5 months ago
Fast Path-Based Neural Branch Prediction
Microarchitectural prediction based on neural learning has received increasing attention in recent years. However, neural prediction remains impractical because its superior accur...
Daniel A. Jiménez
DSN
2002
IEEE
15 years 4 months ago
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
Andrea Coccoli, Péter Urbán, Andrea ...
SIAMDM
2008
113views more  SIAMDM 2008»
14 years 11 months ago
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...