763 search results - page 127 / 153 » Engineering Shortest Path Algorithms |
135
click to vote
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
170
click to vote
CIKM
1997
Springer
15 years 6 months ago
1997
Springer
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
148
click to vote
FSTTCS
2010
Springer
15 years 7 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
126
Voted
ISSTA
1998
ACM
15 years 6 months ago
1998
ACM
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the prog...
134
click to vote
DAC
2004
ACM
16 years 3 months ago
2004
ACM
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....