Sciweavers

3208 search results - page 129 / 642
» A Lower Bound for Primality
Sort
View
IBERAMIA
2004
Springer
15 years 11 months ago
A Max-SAT Solver with Lazy Data Structures
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
Teresa Alsinet, Felip Manyà, Jordi Planes
AAECC
2003
Springer
119views Algorithms» more  AAECC 2003»
15 years 11 months ago
Optimal 2-Dimensional 3-Dispersion Lattices
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
Moshe Schwartz, Tuvi Etzion
RANDOM
1998
Springer
15 years 10 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
ARSCOM
2008
103views more  ARSCOM 2008»
15 years 6 months ago
Estimating the number of graphs containing very long induced paths
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
Steven Butler
DSN
2006
IEEE
16 years 14 days ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...