2796 search results - page 371 / 560 » The coolest path problem |
177
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
196
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
170
click to vote
FLAIRS
2006
15 years 8 months ago
2006
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
183
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
193
click to vote
FSTTCS
2008
Springer
15 years 7 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...