Sciweavers

4714 search results - page 771 / 943
» The Complexity of Iterated Multiplication
Sort
View
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 10 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
COOPIS
1997
IEEE
15 years 10 months ago
Design and Implementation of a Distributed Workflow Enactment Service
Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments which a...
Esin Gokkoca, Mehmet Altinel, Ibrahim Cingil, Nesi...
FOCS
1995
IEEE
15 years 10 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
GECCO
2010
Springer
174views Optimization» more  GECCO 2010»
15 years 10 months ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
AAAI
2007
15 years 8 months ago
Logical Generative Models for Probabilistic Reasoning about Existence, Roles and Identity
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
David Poole