Sciweavers

134 search results - page 8 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
114
Voted
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 2 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
87
Voted
ICCAD
1997
IEEE
91views Hardware» more  ICCAD 1997»
15 years 3 months ago
Interconnect layout optimization under higher-order RLC model
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
Jason Cong, Cheng-Kok Koh
76
Voted
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 5 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ATAL
2010
Springer
15 years 1 days ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
83
Voted
CIS
2004
Springer
15 years 4 months ago
Knowledge Maintenance on Data Streams with Concept Drifting
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
Juggapong Natwichai, Xue Li