2976 search results - page 252 / 596 » On the bounded integer programming |
167
click to vote
DAC
2005
ACM
15 years 7 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
160
Voted
APVIS
2007
15 years 6 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
165
Voted
OPODIS
2007
15 years 6 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
153
Voted
SODA
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
157
Voted
COMBINATORICA
2008
15 years 5 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...