Sciweavers

1707 search results - page 57 / 342
» Early Integer Programming
Sort
View
JSW
2007
102views more  JSW 2007»
14 years 9 months ago
Model-driven Engineering for Early QoS Validation of Component-based Software Systems
— Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based syste...
James H. Hill, Aniruddha S. Gokhale
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 1 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
COLOGNETWENTE
2009
14 years 11 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
RV
2009
Springer
155views Hardware» more  RV 2009»
15 years 2 months ago
Hardware Supported Flexible Monitoring: Early Results
Monitoring of software’s execution is crucial in numerous software development tasks. Current monitoring efforts generally require extensive instrumentation of the software or d...
Antonia Zhai, Guojin He, Mats Per Erik Heimdahl
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
15 years 10 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal