7758 search results - page 376 / 1552 » On the Number of Distributive Lattices |
159
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
183
click to vote
BMVC
1998
15 years 8 months ago
1998
The classification of sets of mixed pixels can be accomplished by making use of the relationship of higher order moments of the distributions of the pure and mixed classes. As a c...
173
click to vote
DM
2008
15 years 6 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
171
click to vote
JETAI
2008
15 years 6 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
185
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...