2042 search results - page 268 / 409 » Variable Number of |
118
click to vote
IJCAI
1997
15 years 5 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
162
click to vote
IJCAI
1993
15 years 5 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
139
click to vote
COLT
2008
Springer
15 years 5 months ago
2008
Springer
The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricksâ€...
138
click to vote
EOR
2008
15 years 4 months ago
2008
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
131
click to vote
IGPL
2006
15 years 4 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...