Sciweavers

976 search results - page 55 / 196
» The Complexity of Timetable Construction Problems
Sort
View
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 4 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
WETICE
1996
IEEE
14 years 1 months ago
Independent validation of specifications: a coordination headache
Large, complex projects face significant barriers to coordination and communication due to continuous, rapid changes during a project's lifecycle. Such changes must be tracke...
Steve M. Easterbrook, John R. Callahan
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
14 years 3 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
ARTS
1997
Springer
14 years 20 days ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
JMLR
2012
11 years 11 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee