3719 search results - page 127 / 744 » order 2010 |
113
click to vote
ISMVL
2010
IEEE
15 years 7 months ago
2010
IEEE
—Using EXOR gates in logic synthesis often results in smaller circuit realizations. While in AND/OR synthesis the problem definition is clear, in AND/EXOR synthesis several clas...
164
click to vote
JCT
2010
15 years 2 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
158
click to vote
ANTSW
2010
Springer
15 years 1 months ago
2010
Springer
Robot swarms provide a way for a number of simple robots to work together to carry out a task. While swarms have been found to be adaptable, fault-tolerant and widely applicable, d...
121
click to vote
EOR
2006
15 years 3 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
132
click to vote
ENDM
2002
15 years 3 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...