1723 search results - page 27 / 345 » Cycling in linear programming problems |
101
click to vote
AIPS
2008
15 years 4 months 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...
112
click to vote
FSS
2002
15 years 2 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...
118
Voted
EMNLP
2010
15 years 13 days 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...
126
click to vote
NETCOOP
2007
Springer
15 years 8 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...
105
Voted
FOCS
1991
IEEE
15 years 6 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 + √ ...