Sciweavers

870 search results - page 10 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
PPSN
2010
Springer
13 years 5 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
FOCS
2002
IEEE
14 years 10 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
14 years 20 days ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 23 days ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
ICALP
2005
Springer
14 years 28 days ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz