1424 search results - page 106 / 285 » The Multi-radius Cover Problem |
129
Voted
DAC
1996
ACM
15 years 7 months ago
1996
ACM
-- We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves s...
115
Voted
ICGI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
116
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
111
Voted
JSYML
2008
15 years 3 months ago
2008
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...
112
Voted
PPL
2008
15 years 3 months ago
2008
This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for mult...