Sciweavers

1839 search results - page 182 / 368
» Feature Selection in Clustering Problems
Sort
View
ICA3PP
2005
Springer
15 years 3 months ago
Hierarchical Parallel Simulated Annealing and Its Applications
In this paper we propose a new parallelization scheme for Simulated Annealing — Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, d...
Shiming Xu, Wenguang Chen, Weimin Zheng, Tao Wang,...
111
Voted
ISPAN
2005
IEEE
15 years 3 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
88
Voted
IH
2001
Springer
15 years 2 months ago
Computational Forensic Techniques for Intellectual Property Protection
Computational forensic engineering (CFE) aims to identify the entity that created a particular intellectual property (IP). Rather than relying on watermarking content or designs, t...
Jennifer L. Wong, Darko Kirovski, Miodrag Potkonja...
EWCBR
2000
Springer
15 years 1 months ago
Maintaining Case-Based Reasoning Systems Using Fuzzy Decision Trees
This paper proposes a methodology of maintaining Case Based Reasoning (CBR) systems by using fuzzy decision tree induction - a machine learning technique. The methodology is mainly...
Simon C. K. Shiu, Cai Hung Sun, Xizhao Wang, Danie...
96
Voted
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 1 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...