4131 search results - page 297 / 827 » The Generalized Max-Controlled Set Problem |
120
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
116
Voted
UAI
2004
15 years 6 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
174
Voted
AAAI
1996
15 years 6 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...
107
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
120
click to vote
COR
2006
15 years 4 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...