Sciweavers

202 search results - page 18 / 41
» Cycle Cover with Short Cycles
Sort
View
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 1 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 9 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
WWW
2008
ACM
14 years 8 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
IPCCC
2007
IEEE
14 years 1 months ago
Compiler-Directed Functional Unit Shutdown for Microarchitecture Power Optimization
Leakage power is a major concern in current microarchitectures as it is increasing exponentially with decreasing transistor feature sizes. In this paper, we present a technique ca...
Santosh Talli, Ram Srinivasan, Jeanine Cook
ASPDAC
2006
ACM
95views Hardware» more  ASPDAC 2006»
14 years 1 months ago
The design and implementation of a low-latency on-chip network
— Many of the issues that will be faced by the designers of multi-billion transistor chips may be alleviated by the presence of a flexible global communication infrastructure. I...
Robert D. Mullins, Andrew West, Simon W. Moore