1310 search results - page 229 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
PODC
1990
ACM
15 years 1 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
EURODAC
1994
IEEE
15 years 1 months ago
1994
IEEE
This paper presents a multiple-FPGA-based experimentation board. The problem to be solved is that of implementing a circuit into a set of FPGAs. This board provides a hardware env...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
GPEM
2002
14 years 9 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...