Sciweavers

2657 search results - page 8 / 532
» On the complexity of hierarchical problem solving
Sort
View
CLASSIFICATION
2008
73views more  CLASSIFICATION 2008»
14 years 9 months ago
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the ama...
Alberto Fernández, Sergio Gómez
MOR
2002
94views more  MOR 2002»
14 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 3 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana
ISCAS
2005
IEEE
115views Hardware» more  ISCAS 2005»
15 years 3 months ago
Power-aware slack distribution for hierarchical VLSI design
Abstract— Hierarchical design plays an important role in microprocessor and ASIC domains where design complexity limits design productivity and tool capacity. Slack distribution,...
Hyung-Ock Kim, Youngsoo Shin