Sciweavers

257 search results - page 40 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
CP
2006
Springer
15 years 1 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
DSN
2007
IEEE
15 years 4 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
80
Voted
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 3 months ago
Evolutionary Drug Scheduling Model for Cancer Chemotherapy
This paper presents a modified optimal control model of drug scheduling in cancer chemotherapy and a new adaptive elitist-population based genetic algorithm (AEGA) to solve it. Wo...
Yong Liang, Kwong-Sak Leung, Tony Shu Kam Mok
GCSE
2000
Springer
15 years 1 months ago
Generic Components: A Symbiosis of Paradigms
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of software...
Martin Becker