2474 search results - page 13 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
EUROPAR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
EOR
2006
13 years 8 months ago
2006
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
GECCO
2000
Springer
14 years 7 days ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
CONSTRAINTS
2010
13 years 6 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
IPPS
1998
IEEE
14 years 27 days ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...