3208 search results - page 291 / 642 » A Lower Bound for Primality |
168
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
164
Voted
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
170
Voted
ISIPTA
2003
IEEE
15 years 12 months ago
2003
IEEE
We apply random set theory to an analysis of future climate change. Bounds on cumulative probability are used to quantify uncertainties in natural and socio-economic factors that ...
186
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
167
click to vote
GD
2003
Springer
15 years 12 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...