2681 search results - page 451 / 537 » Problem F |
115
Voted
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
120
click to vote
SMA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
147
click to vote
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
104
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
166
Voted
DAC
2005
ACM
16 years 3 months ago
2005
ACM
As the d esig n-m anu factu ring interface becom es increasing ly com plicated with IC technolog y scaling , the correspond ing process variability poses g reat challeng es for na...