Sciweavers

13841 search results - page 2163 / 2769
» Algorithms and Constraint Programming
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 4 months ago
Evolutionary Approach to Test Generation for Functional BIST
In the paper, an evolutionary approach to test generation for functional BIST is considered. The aim of the proposed scheme is to minimize the test data volume by allowing the dev...
Y. A. Skobtsov, D. E. Ivanov, V. Y. Skobtsov, Raim...
COR
2011
15 years 2 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
MP
2011
15 years 2 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
NFM
2011
223views Formal Methods» more  NFM 2011»
15 years 2 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...
204
Voted
JGO
2010
100views more  JGO 2010»
15 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
« Prev « First page 2163 / 2769 Last » Next »