Sciweavers

1299 search results - page 14 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
SIAMJO
2000
88views more  SIAMJO 2000»
14 years 9 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
IJCM
2002
97views more  IJCM 2002»
14 years 9 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
DATE
2008
IEEE
107views Hardware» more  DATE 2008»
15 years 4 months ago
Instruction Set Extension Exploration in Multiple-Issue Architecture
To satisfy high-performance computing demand in modern embedded devices, current embedded processor architectures provide designer with possibility either to define customized ins...
I-Wei Wu, Zhi-Yuan Chen, Jean Jyh-Jiun Shann, Chun...
SIAMJO
2008
212views more  SIAMJO 2008»
14 years 9 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
JUCS
2002
179views more  JUCS 2002»
14 years 9 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson