Sciweavers

6976 search results - page 66 / 1396
» The Oil Searching Problem
Sort
View
134
Voted
DAM
2008
68views more  DAM 2008»
15 years 5 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
165
Voted
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 10 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
IJNSEC
2008
132views more  IJNSEC 2008»
15 years 5 months ago
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups
In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjug...
Atul Chaturvedi, Sunder Lal
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 11 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
15 years 11 months ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao