8094 search results - page 179 / 1619 » Improvements in Formula Generalization |
LPNMR
2005
Springer
14 years 3 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
IJCNN
2000
IEEE
14 years 2 months ago
2000
IEEE
Many machine learning algorithms can be formulated as the minimization of a training criterion which involves (1) \training errors" on each training example and (2) some hype...
ISHPC
1999
Springer
14 years 2 months ago
1999
Springer
Superscalar microprocessor efficiency is generally not as high as anticipated. In fact, sustained utilization below thirty percent of peak is not uncommon, even for fully optimized...
AMAST
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
COCO
1991
Springer
14 years 1 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...