Sciweavers

3838 search results - page 414 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
JMLR
2006
96views more  JMLR 2006»
15 years 6 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
CC
2004
Springer
16 years 4 days ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 10 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CSL
2002
Springer
15 years 6 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
WCRE
2009
IEEE
16 years 1 months ago
Automatic Package Coupling and Cycle Minimization
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
Hani Abdeen, Stéphane Ducasse, Houari A. Sa...