Sciweavers

12825 search results - page 99 / 2565
» Improved PLSOM algorithm
Sort
View
EVOW
2004
Springer
15 years 10 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
ICDM
2003
IEEE
125views Data Mining» more  ICDM 2003»
15 years 10 months ago
Improving Home Automation by Discovering Regularly Occurring Device Usage Patterns
The data stream captured by recording inhabitantdevice interactions in an environment can be mined to discover significant patterns, which an intelligent agent could use to automa...
Edwin O. Heierman III, Diane J. Cook
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
15 years 10 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu
KCAP
2003
ACM
15 years 10 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker