14158 search results - page 471 / 2832 » Generalized switch-setting problems |
181
click to vote
WM
2003
15 years 7 months ago
2003
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
152
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
146
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
164
Voted
SAT
2004
Springer
15 years 11 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
157
click to vote
EWCBR
1993
Springer
15 years 10 months ago
1993
Springer
Problem solving in weak theory domains should compensate for the lack of strong theories by combining the various other knowledge types involved. Such methods should be able to eff...