519 search results - page 7 / 104 » A New Approach to Strongly Polynomial Linear Programming |
107
click to vote
FOSSACS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
FSS
2006
15 years 1 months ago
2006
A class of fuzzy linear programming (FLP) problems with fuzzy coefficients based on fuzzy relations is introduced, the concepts of feasible and (, )-maximal and minimal solutions ...
BMCBI
2008
15 years 1 months ago
2008
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
106
click to vote
IJCAI
2003
15 years 2 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
127
click to vote
ERSHOV
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...