Searched for Maria Roussou  [new search]  [edit/save query]  [advanced search]
Searched The ACM Full-Text Collection: 569,850 records   [Expand your search to The ACM Guide to Computing Literature: 2,871,578 records] Help: ACM vs. Guide
Refinements  [remove all]  click each refinement below to remove
Proceeding Series: GECCO
77 results found
Export Results: bibtexendnoteacmrefcsv

Refine by People
Names show/hide
Institutions show/hide
Authors show/hide
Refine by Publications
Publication Names show/hide
ACM Publications show/hide
All Publications show/hide
Content Formats show/hide
Publishers show/hide
Refine by Conferences
Sponsors show/hide
Events show/hide
Proceeding Series show/hide
Refine by Publication Year
2005
Result 1 – 20 of 77
Result page: 1 2 3 4

Sort by:

1 published by ACM
July 2013 GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 45

Full text available: PDFPDF
Technological and command-programming control contours of a spacecraft are modelled with Markov chains. These models are used for the preliminary design of spacecraft control system effective structure with the use of special DSS. Corresponding optimization problems with algorithmically given functions of mixed variables are solved with a special stochastic algorithm ...
Keywords: complex optimization problems, effective variant choice, island model, markov chains, self-configuring genetic algorithm, spacecraft control contours modelling
[result highlights]

2 published by ACM
July 2016 GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 72

Full text available: PDFPDF
In this work we present different learning strategies focused on detecting candidate solutions that are not interesting to be explored by a metaheuristic, in terms of evaluation function. We include a first step before the metaheuristic. The information obtained from this step is given to the metaheuristic, for visiting candidate ...
Keywords: ant algorithms, antipheromone, negative pheromone, opposite learning strategies
[result highlights]

3 published by ACM
July 2016 GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Downloads (Overall): 103

Full text available: PDFPDF
The Office Space Allocation problem is a combinatorial optimization problem which focuses into determining the way to assign spaces to entities in order to optimize the use of available space in an organization. This allocation process considers a set of preferences, constraints and requirements. In this paper we propose a ...
Keywords: greedy, local search, office space allocation, tabu search
[result highlights]

4 published by ACM
July 2010 GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 119

Full text available: PDFPDF
Most metaheuristics define a set of parameters that must be tuned. A good setup of those parameter values can lead to take advantage of all the metaheuristic capabilities to solve the problem at hand. Tuning techniques are step by step methods based on multiple runs of the algorithm. In this ...
Keywords: evolutionary algorithms, parameter setting problem
[result highlights]

5 published by ACM
July 2015 GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 29

Full text available: PDFPDF
ParamILS is a sophisticated tuning method able to provide valuable information for designers and manage conditional parameters. EvoCa is a recently proposed tuner which does not require a fine definition of the initial parameters values. In this work, we propose a collaborative framework between EvoCa and ParamILS to generate quality ...
Keywords: code refining, tuning
[result highlights]

6 published by ACM
July 2015 GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 33

Full text available: PDFPDF
This paper proposes a two-step ants algorithm for the Multidimensional Knapsack Problem. In the first step, the algorithm uses an Anti-pheromone to detect which objects are less suitable to be part of a near-optimal solution solving the opposite problem. From this information, in the second step an ant-based algorithm continues ...
Keywords: antipheromone, ants algorithm, metaheuristics, optimization
[result highlights]

7 published by ACM
July 2012 GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 122

Full text available: PDFPDF
In this paper, we introduce a method which goal is to help the search done by a Stochastic Local Search algorithm. Given a set of initial configurations, our algorithm dynamically discriminates the ones that seems to give more promising solutions, discarding at the same time those which did not help. ...
Keywords: dynamic search, parameter control, stochastic local search, traveling tournament problem
[result highlights]

8 published by ACM
July 2012 GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 113

Full text available: PDFPDF
This paper proposes three post-processing operators (rule cleaning, rule pruning and rule swapping) which combined together in different ways can help reduce the complexity of decision lists evolved by means of genetics-based machine learning. While the first two operators work on the independent rules to reduce the number of expressed ...
Keywords: classification, decision lists, ruleset compaction, ruleset post-processing
[result highlights]

9 published by ACM
July 2010 GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 30
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Downloads (Overall): 333

Full text available: PDFPDF
In this paper we introduce a method for computing fitness in evolutionary learning systems based on NVIDIA's massive parallel technology using the CUDA library. Both the match process of a population of classifiers against a training set and the computation of the fitness of each classifier from its matches have ...
Keywords: evolutionary algorithms, gpgpus, large-scale datasets, learning classifier systems, rule induction
[result highlights]

10 published by ACM
July 2010 GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 100

Full text available: PDFPDF
In this work we present an exhaustive empirical analysis of the Pittsburgh-style BioHEL system using a broad set of variants of the well-known k-DNF boolean function. These functions present a broad set of possible challenges for most machine learning techniques such as varying degrees of rule specificity, class unbalance and ...
Keywords: evolutionary algorithms, large-scale datasets, learning classifier systems, rule induction
[result highlights]

11 published by ACM
July 2015 GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 144

Full text available: PDFPDF
Mission Planning Problem for a large number of Unmanned Air Vehicles (UAV) consists of a set of locations to visit in different time windows, and the actions that the vehicle can perform based on its features such as the sensors, speed or fuel capacity. After formulating this problem as a ...
Keywords: constraint satisfaction problems, genetic algorithms, mission planning, multi-objective, unmanned aircraft systems
[result highlights]

12 published by ACM
July 2010 GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 89

Full text available: PDFPDF
Success Rate (SR) is a statistic straightforward to use and interpret, however a number of non-trivial statistical issues arises when it is examinated in detail. We address some of those issues, providing evidence that suggests that SR follows a binomial density function, therefore its statistical properties are independent of the ...
Keywords: binomial, confidence intervals, coverage, success probability
[result highlights]

13 published by ACM
July 2011 GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 93

Full text available: PDFPDF
Models in Genetic Based Machine Learning (GBML) systems are commonly used to gain understanding of how the system works and, as a consequence, adjust it better. In this paper we propose models for the probability of having a good initial population using the Attribute List Knowledge Representation (ALKR) for discrete ...
Keywords: ALKR, GABIL, evolutionary algorithms, learning classifier systems, rule induction
[result highlights]

14 published by ACM
July 2007 GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 385

Full text available: PDFPDF
In this paper, we introduce a formal-language model for explicitly formalizing agent-environment interaction in a multi-agent systems (MAS) framework: Conversational Grammar Systems (CGS). The main goal of the model is to provide a formal framework for defining how agents interact with environments in MAS. CGS offer a model with a ...
Keywords: artificial life, eco-grammar systems, environment, formal languages
[result highlights]

15 published by ACM
July 2019 GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 18,   Downloads (Overall): 18

Full text available: PDFPDF
Detecting the emotional content of text is one of the most popular NLP tasks. In this paper, we propose a new methodology based on identifying "idealised" words that capture the essence of an emotion; we define these words as having the minimal distance (using some metric function) between a word ...
Keywords: emotion detection, evolution strategy
[result highlights]

16 published by ACM
July 2019 GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 17,   Downloads (Overall): 17

Full text available: PDFPDF
This work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed algorithm is a decoder that translates any vector of real-values into valid solutions to the ...
Keywords: biased random key genetic algorithm, weighted independent domination
[result highlights]

17 published by ACM
July 2013 GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 65

Full text available: PDFPDF
Logistics network design is one of the principal parts of strategic decisions in the planning and control of production systems. It deals with determining the warehouses locations and the definition of product flow between facilities and clients. This work is focused in finding an approximation of the Pareto-optimal front for ...
Keywords: metaheuristics, multi-objective, network design
[result highlights]

18 published by ACM
July 2008 GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Downloads (Overall): 351

Full text available: PDFPDF
In choosing a color palette, it is necessary to take into the account the needs of color vision impaired users, in order to make information and services accessible to a broader audience. This means to search the space of color palettes aimed to find a color combination representing a good ...
Keywords: accessibility, search based software engineering, vision impaired
[result highlights]

19 published by ACM
July 2008 GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 237

Full text available: PDFPDF
The Trading Agent Competition in its category Supply Chain Management (TAC SCM) is an international forum where teams construct agents that control a computer assembly company in a simulated environment. TAC SCM involves the following problems: to determine when to send offers, to determine final sales prices of offered goods ...
Keywords: TAC SCM, XCSR, classifier systems, supply chain management
[result highlights]

20 published by ACM
July 2006 GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 327

Full text available: PDFPDF
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portfolio selection process. The nonlinear mixed integer quadratic programming model is considerably more difficult to solve than the original model; but ...
Keywords: Markowitz model, mixed integer programming, portfolio selection
[result highlights]

Result 1 – 20 of 77
Result page: 1 2 3 4



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us