Sciweavers

92 search results - page 7 / 19
» Computing the Shortest Essential Cycle
Sort
View
CCGRID
2003
IEEE
14 years 19 days ago
Creating Services with Hard Guarantees from Cycle-Harvesting Systems
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
Chris Kenyon, Giorgos Cheliotis
ASPDAC
2007
ACM
74views Hardware» more  ASPDAC 2007»
13 years 11 months ago
A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
Tan Yan, Shuting Li, Yasuhiro Takashima, H. Murata
DBA
2004
93views Database» more  DBA 2004»
13 years 8 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
NETWORKS
2010
13 years 5 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
MP
2006
88views more  MP 2006»
13 years 7 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...