8780 search results - page 200 / 1756 » On the Feasibility of Consistent Computations |
173
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
199
click to vote
ALENEX
2007
15 years 8 months ago
2007
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...
147
click to vote
CG
2006
Springer
15 years 7 months ago
2006
Springer
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
182
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
164
click to vote
JEA
2010
15 years 2 months ago
2010
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...