Sciweavers

842 search results - page 148 / 169
» Search Control Techniques for Planning
Sort
View
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 15 days 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
CGF
2008
103views more  CGF 2008»
13 years 9 months ago
An Example-based Procedural System for Element Arrangement
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based-on a local neighborh...
Takashi Ijiri, Radomír Mech, Takeo Igarashi...
PVLDB
2010
151views more  PVLDB 2010»
13 years 7 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
ERLANG
2003
ACM
14 years 2 months ago
Evaluating distributed functional languages for telecommunications software
The distributed telecommunications sector not only requires minimal time to market, but also software that is reliable, available, maintainable and scalable. High level programmin...
Jan Henry Nyström, Philip W. Trinder, David J...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each oļ¬€sp...
Severino F. Galán, Ole J. Mengshoel