Sciweavers

2796 search results - page 69 / 560
» The coolest path problem
Sort
View
ICSOC
2005
Springer
15 years 7 months ago
Trust-Based Secure Workflow Path Construction
—Service-oriented computing promotes collaboration by defining the standards layer that allows compatibility between disparate domains. Workflows, by taking advantage of the serv...
Mine Altunay, Douglas E. Brown, Gregory T. Byrd, R...
IJFCS
2007
93views more  IJFCS 2007»
15 years 1 months ago
On Computing Longest Paths in Small Graph Classes
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Ryuhei Uehara, Yushi Uno
TOC
2008
95views more  TOC 2008»
15 years 1 months ago
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 7 months ago
Layout-aware pseudo-functional testing for critical paths considering power supply noise effects
When testing delay faults on critical paths, conventional structural test patterns may be applied in functionally-unreachable states, leading to over-testing or under-testing of t...
Xiao Liu, Yubin Zhang, Feng Yuan, Qiang Xu
PVLDB
2010
269views more  PVLDB 2010»
15 years 11 days ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis