Sciweavers

890 search results - page 110 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
COMAD
2008
15 years 7 months ago
Discovering Interesting Subsets Using Statistical Analysis
In this paper we present algorithms for identifying interesting subsets of a given database of records. In many real life applications, it is important to automatically discover s...
Maitreya Natu, Girish Palshikar
ATAL
2010
Springer
15 years 6 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
AAMAS
2005
Springer
15 years 6 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
GECCO
2003
Springer
167views Optimization» more  GECCO 2003»
15 years 11 months ago
Dimensionality Reduction via Genetic Value Clustering
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
Alexander P. Topchy, William F. Punch
RIAO
2007
15 years 7 months ago
A Co-operative Web Services Paradigm for Supporting Crawlers
The traditional crawlers used by search engines to build their collection of Web pages frequently gather unmodified pages that already exist in their collection. This creates unne...
Aravind Chandramouli, Susan Gauch