7827 search results - page 90 / 1566 » time 2007 |
148
click to vote
ACSD
2009
IEEE
15 years 9 months ago
2009
IEEE
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...
160
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
127
click to vote
JGAA
2007
15 years 5 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
153
click to vote
CCE
2004
15 years 5 months ago
2004
Batch time (energy) requirements are provided for the separation of a zeotropic mixture in three batch column configurations. The separation tasks were performed in two different ...
137
click to vote
DBSEC
2007
15 years 7 months ago
2007
Abstract. Modern information systems require temporal and privilegeconsuming usage of digital objects. To meet these requirements, we present a new access control model–Times-bas...