261 search results - page 11 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
CAEPIA
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
MOR
2002
14 years 11 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
126
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...
DAC
2009
ACM
16 years 19 days ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...