Sciweavers

127 search results - page 5 / 26
» Mode Directed Path Finding
Sort
View
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
BCSHCI
2009
13 years 8 months ago
How do people find information on a familiar website?
Previous research has investigated how people either navigate the web as a whole, or find information on websites of which they have little previous knowledge. However, it is now ...
Roy A. Ruddle
ICST
2009
IEEE
14 years 2 months ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...
TCAD
1998
125views more  TCAD 1998»
13 years 7 months ago
Test-point insertion: scan paths through functional logic
—Conventional scan design imposes considerable area and delay overheads. To establish a scan chain in the test mode, multiplexers at the inputs of flip-flops and scan wires are...
Chih-Chang Lin, Malgorzata Marek-Sadowska, Kwang-T...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 9 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska