3415 search results - page 270 / 683 » Lower bounds on kernelization |
193
click to vote
ICIC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
187
click to vote
ACSC
2005
IEEE
16 years 10 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
123
click to vote
ECAL
2005
Springer
16 years 7 days ago
2005
Springer
We compare the long term behaviour of Conway’s Game of Life cellular automaton, from initial random configurations, on a bounded rectangular grid and a bounded Penrose tiling gr...
155
click to vote
GECCO
2004
Springer
16 years 2 days ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
186
click to vote
WAOA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...