2474 search results - page 23 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
160
click to vote
PACT
1999
Springer
15 years 6 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
128
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
116
Voted
ECAL
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Genetic regulatory networks (GRNs) control gene expression and are responsible for establishing the regular cellular patterns that constitute an organism. This paper intr...
112
Voted
CCGRID
2005
IEEE
15 years 7 months ago
2005
IEEE
Grid-enabled portals are becoming increasingly popular as a means to create Grid-based problem-solving environments (PSEs) that allow scientists to access distributed resources, a...
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In spite of the high parallelism exhibited by cellular automata architectures, most implementations are usually run in software. For increasing execution parallelism, hardware imp...