Sciweavers

1333 search results - page 56 / 267
» Categorial Minimalism
Sort
View
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 7 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
73
Voted
OOPSLA
2007
Springer
15 years 7 months ago
The JikesXen Java server platform
ose of the JVM is to abstract the Java language from the hardware and software platforms it runs on. For this reason, the JVM uses services offered by the host operating system in...
Georgios Gousios
118
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
91
Voted
DOCENG
2006
ACM
15 years 6 months ago
Solving the simple continuous table layout problem
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
Nathan Hurst, Kim Marriott, David W. Albrecht
ISLPED
2006
ACM
129views Hardware» more  ISLPED 2006»
15 years 6 months ago
Variation-driven device sizing for minimum energy sub-threshold circuits
Sub-threshold operation is a compelling approach for energyconstrained applications, but increased sensitivity to variation must be mitigated. We explore variability metrics and t...
Joyce Kwong, Anantha P. Chandrakasan