Sciweavers

6149 search results - page 520 / 1230
» Revealing the programming process
Sort
View
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
16 years 18 days ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley
PKDD
2004
Springer
118views Data Mining» more  PKDD 2004»
16 years 13 days ago
Learning from Multi-source Data
This paper proposes an efficient method to learn from multi source data with an Inductive Logic Programming method. The method is based on two steps. The first one consists in lea...
Élisa Fromont, Marie-Odile Cordier, Rene Qu...
SBACPAD
2003
IEEE
102views Hardware» more  SBACPAD 2003»
16 years 11 days ago
Performance Analysis of DECK Collective Communication Service
Collective communication is very useful for parallel applications, especially those in which matrix and vector data structures need to be manipulated by a group of processes. This...
Rafael Ennes Silva, Delcino Picinin, Marcos E. Bar...
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 11 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
ICALP
2009
Springer
15 years 11 months ago
On Observing Dynamic Prioritised Actions in SOC
We study the impact on observational semantics for SOC of priority mechanisms which combine dynamic priority with local pre-emption. We define manageable notions of strong and wea...
Rosario Pugliese, Francesco Tiezzi, Nobuko Yoshida