Sciweavers

834 search results - page 142 / 167
» A Decomposition Technique for Max-CSP
Sort
View
ASE
2002
141views more  ASE 2002»
13 years 9 months ago
On the Automatic Recovery of Style-Specific Architectural Relations in Software Systems
The cost of maintaining a software system over a long period of time far exceeds its initial development cost. Much of the maintenance cost is attributed to the time required by ne...
Martin Traverso, Spiros Mancoridis
CCE
2004
13 years 9 months ago
Modeling and solving real-time scheduling problems by stochastic integer programming
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
Guido Sand, Sebastian Engell
EC
2000
241views ECommerce» more  EC 2000»
13 years 9 months ago
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
Mitchell A. Potter, Kenneth A. De Jong
TOG
2002
129views more  TOG 2002»
13 years 9 months ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey
CIKM
2010
Springer
13 years 8 months ago
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization
Matrix factorization methods are among the most common techniques for detecting latent components in data. Popular examples include the Singular Value Decomposition or Nonnegative...
Christian Thurau, Kristian Kersting, Christian Bau...