Sciweavers

271 search results - page 50 / 55
» Comparison of two interactive search refinement techniques
Sort
View
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 3 months ago
Transgenetic algorithm: a new evolutionary perspective for heuristics design
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
CIKM
2008
Springer
14 years 11 months ago
Summarization of social activity over time: people, actions and concepts in dynamic networks
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
Yu-Ru Lin, Hari Sundaram, Aisling Kelliher
CSC
2006
14 years 11 months ago
A New Migration Model For Distributed Genetic Algorithms
Genetic algorithms are heuristic search algorithm used in science, engineering and many other areas. They are powerful but slow because of their evolutionary nature that mimics th...
Taisir Eldos
AAAI
1994
14 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
AI
2008
Springer
14 years 9 months ago
A study of mechanisms for improving robotic group performance
Many collaborative multi-robot application domains have limited areas of operation that cause spatial conflicts between robotic teammates. These spatial conflicts can cause the te...
Avi Rosenfeld, Gal A. Kaminka, Sarit Kraus, Onn Sh...