Sciweavers

9176 search results - page 361 / 1836
» algorithms 2010
Sort
View
163
Voted
ECCC
2000
101views more  ECCC 2000»
15 years 6 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Oded Goldreich, Salil P. Vadhan, Avi Wigderson
EOR
2002
67views more  EOR 2002»
15 years 6 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
ICCAD
2010
IEEE
224views Hardware» more  ICCAD 2010»
15 years 4 months ago
WISDOM: Wire spreading enhanced decomposition of masks in Double Patterning Lithography
In Double Patterning Lithography (DPL), conflict and stitch minimization are two main challenges. Post-routing mask decomposition algorithms [1
Kun Yuan, David Z. Pan
CCCG
2010
15 years 8 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...
184
Voted
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 11 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...