4894 search results - page 537 / 979 » The Guarding Problem - Complexity and Approximation |
132
click to vote
ISIPTA
1999
IEEE
15 years 9 months ago
1999
IEEE
A solution is provided to the problem of computing a convex set of conditional probability distributions that characterize the state of a nonlinear dynamic system as it evolves in...
131
click to vote
ISPD
1998
ACM
15 years 9 months ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
168
click to vote
CANPC
1998
Springer
15 years 9 months ago
1998
Springer
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
130
click to vote
HYBRID
2000
Springer
15 years 8 months ago
2000
Springer
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
124
click to vote
ICRA
1995
IEEE
15 years 8 months ago
1995
IEEE
2 Multi-view Integration: A Review We address the problem of constructing a boundary model of an object when the input consists of a set of points that lie on its surface. We assum...