All Outputs (11)

A scaleable and robust framework for distributed application. (2002)
Journal Article
Jelasity, M., Preuss, M., & Paechter, B. (2002). A scaleable and robust framework for distributed application. World Congress on Computational Intelligence, 2, 1540-1545

This paper describes a novel tool for running distributed experiments on the Internet. The possible applications include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on... Read More about A scaleable and robust framework for distributed application..

Maintaining connectivity in a scaleable and robust distributed environment. (2002)
Journal Article
Jelasity, M., Preuss, M., Van Steen, M., & Paechter, B. (2002). Maintaining connectivity in a scaleable and robust distributed environment. Cluster Computing and the Grid, 389-394. https://doi.org/10.1109/CCGRID.2002.1017166

This paper describes a novel peer-to-peer (P2P) environment for running distributed Java applications on the Internet. The possible application areas include simple load balancing, parallel evolutionary computation, agent-based simulation and artific... Read More about Maintaining connectivity in a scaleable and robust distributed environment..

A GA evolving instructions for a timetable builder. (2002)
Presentation / Conference Contribution
Blum, C., Correia, S., Dorigo, M., Paechter, B., Rossi-Doria, O., & Snoek, M. (2002). A GA evolving instructions for a timetable builder. In E. Burke, & P. Causmaecker (Eds.), Proceedings of the Conference on the Practice and Theory of Automated Timetabli

In this work we present a Genetic Algorithm for tackling timetabling problems. Our approach uses an indirect solution representation, which denotes a number of instructions for a timetable builder on how to sequentially build a solution. These instru... Read More about A GA evolving instructions for a timetable builder..

A local search for the timetabling problem. (2002)
Presentation / Conference Contribution
Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., & Paechter, B. (2002). A local search for the timetabling problem. In E. Burke, & P. Causmaecker (Eds.), Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PAT

This work is part of the Metaheuristic Network, a European Commission project that seeks to empirically compare the performance of various metaheuristics on different combinatorial optimization problems. In this paper we define a representation, a ne... Read More about A local search for the timetabling problem..

Solving a real world routing problem using multiple evolutionary algorithms. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using multiple evolutionary algorithms. In Parallel Problem Solving from Nature — PPSN VII (871-880). https://doi.org/10.1007/3-540-45712-7_84

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using multiple evolutionary algorithms..

Solving a real world routing problem using evolutionary agents. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using evolutionary agents.

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using evolutionary agents..

A framework for distributed evolutionary algorithms. (2002)
Presentation / Conference Contribution
Arenas, M. G., Collet, P., Eiben, A. E., Jeasity, M., Merelo Guervós, J. J., Paechter, B., …Schoenauer, M. (2002). A framework for distributed evolutionary algorithms. In 7th International Conference, Granada, Spain, September 7-11, 2002, Proceedings

This paper describes the recently released DREAM (Distributed Resource Evolutionary Algorithm Machine) framework for the automatic distribution of evolutionary algorithm (EA) processing through a virtual machine built from large numbers of individual... Read More about A framework for distributed evolutionary algorithms..

A Scalable and Robust Framework for Distributed Applications (2002)
Presentation / Conference Contribution
Jelasity, M., Preuss, M., & Paechter, B. (2002). A Scalable and Robust Framework for Distributed Applications. In Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (1540-1545). https://doi.org/10.1109/CEC.2002.1004471

This paper describes a novel tool for running distributed experiments on the Internet. The possible applications include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on... Read More about A Scalable and Robust Framework for Distributed Applications.

A distributed resource evolutionary algorithm machine. (2002)
Presentation / Conference Contribution
Paechter, B., Baeck, T., Schoenauer, M., Eiben, A. E., Merelo Guervós, J. J., Sebag, M., & Fogarty, T. C. (2002). A distributed resource evolutionary algorithm machine. In Proceedings of the 2000 Congress on Evolutionary Computation, 2000 (951-958). htt

This paper describes a project funded by the European Commission’ which seeks to provide the technology and software infrastructure necessary to support the next generation of evolving infohabitants in a way that makes that infrastructure univers... Read More about A distributed resource evolutionary algorithm machine..

A General Model for the Answer-Perturbation Techniques (2002)
Presentation / Conference Contribution
Stamate, D., Luchian, H., & Paechter, B. (2002). A General Model for the Answer-Perturbation Techniques. In Seventh International Working Conference on Scientific and Statistical Database Management (90-96). https://doi.org/10.1109/SSDM.1994.336958

Answer-perturbation techniques for the protection of statistical databases have been previously introduced (Luchian and Stamate, 1992); they are flexible (perturbation kept under control), modular (do not interact with the DBMS) techniques, which com... Read More about A General Model for the Answer-Perturbation Techniques.

Improving street based routing using building block mutations. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Improving street based routing using building block mutations. In J. Gottlieb, E. Hart, & S. Cagnoni (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTI

Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve this problem using an Evolutionary Algorithm (EA). In this paper the autho... Read More about Improving street based routing using building block mutations..