Sciweavers

457 search results - page 59 / 92
» A Dialectic Approach to Problem-Solving
Sort
View
CCIA
2007
Springer
13 years 11 months ago
Assessing Confidence in Cased Based Reuse Step
Case-Based Reasoning (CBR) is a learning approach that solves current situations by reusing previous solutions that are stored in a case base. In the CBR cycle the reuse step plays...
F. Alejandro García, Javier Orozco, Jordi G...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
13 years 11 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
ATAL
2008
Springer
13 years 9 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
AUTONOMICS
2008
ACM
13 years 9 months ago
Autonomic management via dynamic combinations of reusable strategies
Autonomic Management capabilities become increasingly important for attaining functional and quality goals in software systems. Nonetheless, successful Autonomic Management soluti...
Ada Diaconescu, Yoann Maurel, Philippe Lalanda