19 search results - page 2 / 4 » Necessary Condition for Path Partitioning Constraints |
DATE
2002
IEEE
13 years 10 months ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
ENDM
2007
13 years 5 months ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
INFOCOM
1994
IEEE
13 years 9 months ago
1994
IEEE
We consider the ring network with spatial reuse. Tra c streams may enter and exit the network at any node. We adopt an arrival tra c model with deterministic constraints on its sa...
ANOR
2007
13 years 5 months ago
2007
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...