Sciweavers

1795 search results - page 222 / 359
» Search by strategy
Sort
View
KCAP
2005
ACM
16 years 5 days ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 10 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
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
15 years 7 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
CLEF
2005
Springer
16 years 4 days ago
UNED at iCLEF 2005: Automatic Highlighting of Potential Answers
In this paper, we describe UNED’s participation in the iCLEF 2005 track. We have compared two strategies for finding an answer using an interactive question answering system: i...
Víctor Peinado, Fernando López-Osten...
ICPP
2009
IEEE
16 years 1 months ago
On Maximum Stability with Enhanced Scalability in High-Churn DHT Deployment
Abstract—When applied in a commercial deployment, DHTbased P2P protocols face a dilemma: although most real-world participants are so unstable that the maintenance overhead is pr...
Junfeng Xie, Zhenhua Li, Guihai Chen, Jie Wu