2607 search results - page 328 / 522 » Complete Functional Synthesis |
118
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
155
click to vote
CSJM
2008
15 years 4 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
127
Voted
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
125
click to vote
EOR
2008
15 years 4 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
134
Voted
ENTCS
2006
15 years 4 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...