569 search results - page 60 / 114 » An Empirical Study of Structural Constraint Solving Techniqu... |
200
click to vote
AIIA
1991
Springer
15 years 9 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
178
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper studies the problem of learning from ambiguous supervision, focusing on the task of learning semantic correspondences. A learning problem is said to be ambiguously supe...
205
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
171
click to vote
KI
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
184
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...