1263 search results - page 14 / 253 » A* with Bounded Costs |
DAM
2007
14 years 9 months ago
2007
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
COMBINATORICA
2004
14 years 9 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
ISPD
2004
ACM
15 years 3 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
78
Voted
COR
2008
14 years 9 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
100
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...