Sciweavers

576 search results - page 29 / 116
» Matching methodology to problem domain
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
SPLC
2004
13 years 10 months ago
Experiences in Software Product Families: Problems and Issues During Product Derivation
A fundamental reason for investing in product families is to minimize the application engineering costs. Several organizations that employ product families, however, are becoming i...
Sybren Deelstra, Marco Sinnema, Jan Bosch
WSC
2004
13 years 10 months ago
Visual Modeling of Business Problems: Workflow and Patterns
Computer-based business analysis relies on models, or algorithmic representations of the business process. Real-life business problems can become very complex, which creates diffi...
Lev Virine, Jason McVean
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 11 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 5 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng