Sciweavers

6943 search results - page 501 / 1389
» Representations for evolutionary algorithms
Sort
View
SEMWEB
2009
Springer
16 years 1 months ago
An Algorithm for Learning with Probabilistic Description Logics
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last...
José Eduardo Ochoa Luna, Fabio Gagliardi Co...
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
16 years 17 days ago
Estimating the detector coverage in a negative selection algorithm
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
Zhou Ji, Dipankar Dasgupta
194
Voted
FSTTCS
2004
Springer
16 years 13 days ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
16 years 13 days ago
Trap Avoidance in Strategic Computer Game Playing with Case Injected Genetic Algorithms
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...
Chris Miles, Sushil J. Louis, Rich Drewes
ICALP
2004
Springer
16 years 13 days ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl