4491 search results - page 282 / 899 » Algorithm Engineering |
143
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
107
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
143
click to vote
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
126
click to vote
ASWEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Influence control is a very challenging issue in dynamic reconfiguration and still not well addressed in the literature. This paper argues that dynamic reconfiguration influences s...
102
click to vote
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Since Power Analysis on smart-cards was introduced by Paul Kocher [KJJ98], the validity of the model used for smart-cards has not been given much attention. In this paper, we firs...