Sciweavers

6976 search results - page 214 / 1396
» The Oil Searching Problem
Sort
View
TEC
2002
117views more  TEC 2002»
15 years 6 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
15 years 5 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
CVPR
2011
IEEE
15 years 2 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
Ryan Kennedy, Jean Gallier, Jianbo Shi
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
16 years 1 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
CP
2005
Springer
16 years 20 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen