1723 search results - page 27 / 345 » Cycling in linear programming problems |
AIPS
2008
14 years 3 days ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
FSS
2002
13 years 9 months ago
2002
It is usually supposed that tolerance levels are determined by the decision maker a priori in flexible linear programming (FLP) problems. In this paper we shall suppose that the d...
EMNLP
2010
13 years 7 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
NETCOOP
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...