9842 search results - page 272 / 1969 » The Complexity of the Matching-Cut Problem |
55
Voted
CIE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
51
Voted
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
107
click to vote
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack condi...
86
Voted
FLAIRS
2007
15 years 2 months ago
2007
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
108
Voted
AAAI
2000
15 years 2 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...