Sciweavers

421 search results - page 53 / 85
» A divide-and-merge methodology for clustering
Sort
View
ESWA
2008
166views more  ESWA 2008»
14 years 9 months ago
Modular design to support green life-cycle engineering
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
Hwai-En Tseng, Chien-Chen Chang, Jia-Diann Li
NAR
2007
103views more  NAR 2007»
14 years 9 months ago
InSatDb: a microsatellite database of fully sequenced insect genomes
InSatDb presents an interactive interface to query information regarding microsatellite characteristics per se of five fully sequenced insect genomes (fruitfly, honeybee, malarial...
Sunil Archak, Eshwar Meduri, P. Sravana Kumar, Jav...
CLOUDCOM
2010
Springer
14 years 8 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
IMCSIT
2010
14 years 8 months ago
Learning taxonomic relations from a set of text documents
This paper presents a methodology for learning taxonomic relations from a set of documents that each explain one of the concepts. Three different feature extraction approaches with...
Mari-Sanna Paukkeri, Alberto Pérez Garc&iac...
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
15 years 11 months ago
MultiRelational k-Anonymity
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
Mehmet Ercan Nergiz, Chris Clifton, A. Erhan Nergi...