Sciweavers

2657 search results - page 287 / 532
» On the complexity of hierarchical problem solving
Sort
View
NICSO
2010
Springer
16 years 1 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
IEEEICCI
2007
IEEE
16 years 1 months ago
A Logic Language of Granular Computing
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...
Yiyu Yao, Bing Zhou
IPPS
2007
IEEE
16 years 1 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
EVOW
2007
Springer
16 years 28 days ago
Genetic Representations for Evolutionary Minimization of Network Coding Resources
Abstract. We demonstrate how a genetic algorithm solves the problem of minimizing the resources used for network coding, subject to a throughput constraint, in a multicast scenario...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
157
Voted
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
16 years 28 days ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius