2252 search results - page 147 / 451 » Lower Bounds for Dynamic Algorithms |
135
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
115
Voted
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
128
click to vote
INFOCOM
1992
IEEE
15 years 7 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
128
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
128
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...