840 search results - page 93 / 168 » Inapproximability of Combinatorial Optimization Problems |
92
Voted
CEC
2010
IEEE
2010
IEEE
A binary Particle Swarm Optimization approach to fault diagnosis in parallel and distributed systems
14 years 11 months ago
— The efficient diagnosis of hardware and software faults in parallel and distributed systems remains a challenge in today’s most prolific decentralized environments. System-...
117
click to vote
ANTSW
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
150
Voted
MEMETIC
2010
14 years 7 months ago
2010
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
97
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
186
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...