Sciweavers

3250 search results - page 276 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICALP
2000
Springer
15 years 10 months ago
A New Unfolding Approach to LTL Model Checking
Abstract A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix. The techniq...
Javier Esparza, Keijo Heljanko
CEC
2009
IEEE
16 years 1 months ago
Local search based evolutionary multi-objective optimization algorithm for constrained and unconstrained problems
Abstract— Evolutionary multi-objective optimization algorithms are commonly used to obtain a set of non-dominated solutions for over a decade. Recently, a lot of emphasis have be...
Karthik Sindhya, Ankur Sinha, Kalyanmoy Deb, Kaisa...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 10 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
PAA
2010
15 years 5 months ago
A simple iterative algorithm for parsimonious binary kernel Fisher discrimination
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
Robert F. Harrison, Kitsuchart Pasupa
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...