Results 1  10
of
17,043
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 331 (43 self)
 Add to MetaCart
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some
Inverse feasible problem
"... Abstract In many infeasible linear programs it is important to construct it to a feasible problem with a minimum parameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called "inverse feasible problem". For a given infeasible polyhedron ..."
Abstract
 Add to MetaCart
Abstract In many infeasible linear programs it is important to construct it to a feasible problem with a minimum parameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called "inverse feasible problem". For a given infeasible polyhedron
The colourful feasibility problem
 DISCRETE APPL. MATH
, 2005
"... We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Bárány and Onn with new methods. We perform benchmarking on generic and illconditioned problems, as well as as recently introduced highly structured problems. We show that som ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Bárány and Onn with new methods. We perform benchmarking on generic and illconditioned problems, as well as as recently introduced highly structured problems. We show
Projection Algorithm for Split Feasibility Problem
"... Abstract. The split feasibility problem has many applications in various fields of science and technology (for example solving systems of linear equalities and/or inequalities). The class of methods, generally called projection methods, has witnessed great progress in recent years and the algorithms ..."
Abstract
 Add to MetaCart
Abstract. The split feasibility problem has many applications in various fields of science and technology (for example solving systems of linear equalities and/or inequalities). The class of methods, generally called projection methods, has witnessed great progress in recent years
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 773 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Algorithms and tests for the colourful feasibility problem
, 2007
"... We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Bárány and Onn with new methods. This is a challenging problem on the borderline of tractability, its complexity is an open question. We perform benchmarking on generic and ill ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Bárány and Onn with new methods. This is a challenging problem on the borderline of tractability, its complexity is an open question. We perform benchmarking on generic
Feasibility Problems for Recurring Tasks on One Processor
, 1992
"... We give a comprehensive summary of our recent research on the feasibility problems for various types of hardrealtime preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the fi ..."
Abstract

Cited by 57 (10 self)
 Add to MetaCart
We give a comprehensive summary of our recent research on the feasibility problems for various types of hardrealtime preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
Results 1  10
of
17,043