Sciweavers

530 search results - page 83 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
AUSSOIS
2001
Springer
14 years 1 days ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi
EAAI
2008
106views more  EAAI 2008»
13 years 7 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
DATE
2010
IEEE
121views Hardware» more  DATE 2010»
14 years 18 days ago
Properties of and improvements to time-domain dynamic thermal analysis algorithms
—Temperature has a strong influence on integrated circuit (IC) performance, power consumption, and reliability. However, accurate thermal analysis can impose high computation co...
Xi Chen, Robert P. Dick, Li Shang
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
13 years 11 months ago
Deceptiveness and neutrality the ND family of fitness landscapes
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
William Beaudoin, Sébastien Vérel, P...
NECO
2008
108views more  NECO 2008»
13 years 7 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer