14518 search results - page 401 / 2904 » Two Problems for Sophistication |
166
click to vote
AISB
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
196
click to vote
WSCG
2004
15 years 8 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
171
Voted
AAAI
1994
15 years 8 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
239
click to vote
DAGSTUHL
2009
15 years 8 months ago
2009
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
262
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...