Sciweavers

2796 search results - page 152 / 560
» The coolest path problem
Sort
View
DIAGRAMS
2006
Springer
15 years 8 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
WADS
1995
Springer
82views Algorithms» more  WADS 1995»
15 years 8 months ago
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
Dimitrios Kagaris, Spyros Tragoudas, Grammati E. P...
DAC
2001
ACM
16 years 6 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
CADE
2007
Springer
16 years 5 months ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp
ICDCSW
2005
IEEE
15 years 10 months ago
Specifying Information-Flow Controls
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
Howard Chivers, Jeremy Jacob