9842 search results - page 293 / 1969 » The Complexity of the Matching-Cut Problem |
138
Voted
ACISP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
117
Voted
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
103
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
128
Voted
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
142
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...