Sciweavers

4342 search results - page 661 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
EVOW
2006
Springer
15 years 8 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
15 years 6 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
IJCAI
2007
15 years 5 months ago
Constructing New and Better Evaluation Measures for Machine Learning
Evaluation measures play an important role in machine learning because they are used not only to compare different learning algorithms, but also often as goals to optimize in cons...
Jin Huang, Charles X. Ling
MVA
1994
113views Computer Vision» more  MVA 1994»
15 years 5 months ago
A Modified Simulation Environment for Reconfigurable Multicomputer Systems in Digital Image Processing Applications
In our work we improve the EPPI programming environment, which was made in the University of Castilla - la Mancha one year ago. EPPI is a tool for simulating parallel algorithms t...
Francisco J. Quiles, Antonio Jose Garrido del Solo
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 5 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson