44651 search results - page 315 / 8931 » A Generalization of the Least General Generalization |
159
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
172
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
168
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
170
click to vote
MMMACNS
2001
Springer
15 years 11 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
181
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...