9842 search results - page 342 / 1969 » The Complexity of the Matching-Cut Problem |
109
click to vote
HAIS
2009
Springer
15 years 8 months ago
2009
Springer
One of the most important challenges in supervised learning is how to evaluate the quality of the models evolved by different machine learning techniques. Up to now, we have relied...
142
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
145
click to vote
IFIPTCS
2000
15 years 7 months ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...
115
click to vote
AIPS
2006
15 years 5 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
144
click to vote
AAAI
1994
15 years 5 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...