Sciweavers

2635 search results - page 140 / 527
» Algorithms for the Database Layout Problem
Sort
View
LSGRID
2004
Springer
15 years 9 months ago
Mega Process Genetic Algorithm Using Grid MP
In this study, a new Genetic Algorithm (GA) using the Tabu · Local Search mechanism is proposed. The GA described in this paper is considered a Mega Process GA, which has an effe...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki,...
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 6 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
HIPC
2005
Springer
15 years 10 months ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
CAIP
1999
Springer
140views Image Analysis» more  CAIP 1999»
15 years 8 months ago
Complex Analysis for Reconstruction from Controlled Motion
We address the problem of control-based recovery of robot pose and the environmental lay-out. Panoramic sensors provide us with a 1D projection of characteristic features of a 2D ...
R. Andrew Hicks, David Pettey, Konstantinos Daniil...
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
15 years 6 months ago
Low power clock buffer planning methodology in F-D placement for large scale circuit design
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...