Sciweavers

3736 search results - page 209 / 748
» Generative Programming
Sort
View
TEC
1998
106views more  TEC 1998»
15 years 2 months ago
Combining mutation operators in evolutionary programming
Abstract— Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized p...
Kumar Chellapilla
OL
2011
177views Neural Networks» more  OL 2011»
14 years 6 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
101
Voted
IWPC
2010
IEEE
15 years 1 months ago
DepDigger: A Tool for Detecting Complex Low-Level Dependencies
We present a tool that identifies complex data-flow dependencies on code-level, based on the measure dep-degree. Low-level dependencies between program operations are modeled by...
Dirk Beyer, Ashgan Fararooy
MDM
2007
Springer
103views Communications» more  MDM 2007»
15 years 9 months ago
Variant Bandwidth Channel Allocation in the Data Broadcasting Environment
Data broadcast is a technique to realize energy saving and bandwidth utilization in a mobile computing environment. However, traditional schemes schedule data items without consid...
Chung-Hua Chu, Hao-Ping Hung, Ming-Syan Chen
125
Voted
ICFP
2002
ACM
16 years 3 months ago
Compiling scheme to JVM bytecode: : a performance study
We have added a Java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new...
Bernard P. Serpette, Manuel Serrano