Sciweavers

6943 search results - page 479 / 1389
» Representations for evolutionary algorithms
Sort
View
EXPERT
1998
83views more  EXPERT 1998»
15 years 6 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 4 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
ICCAD
1998
IEEE
79views Hardware» more  ICCAD 1998»
15 years 10 months ago
Reencoding for cycle-time minimization under fixed encoding length
This paper presents efficient reencoding and resynthesis algorithms for cycle-time minimization of multilevel implementations of synchronous finite state machines (FSMs) under a fi...
Balakrishnan Iyer, Maciej J. Ciesielski
DLOG
2003
15 years 8 months ago
Computing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
Sebastian Brandt, Anni-Yasmin Turhan
ACL
1998
15 years 8 months ago
Segregatory Coordination and Ellipsis in Text Generation
In this paper, we provide an account of how to generate sentences with coordination constructions from clause-sized semantic representations. An algorithm is developed and various...
James Shaw