1757 search results - page 291 / 352 » Alternating Refinement Relations |
108
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
122
click to vote
CF
2006
ACM
15 years 6 months ago
2006
ACM
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
83
Voted
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
Managers of systems of shared resources typically have many separate goals. Examples are efficient utilization of the resources among its users and ensuring no user’s satisfacti...
97
Voted
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
There are two ways of handling bilateral multi-issue negotiations – one is to negotiate all the issues together, and the other is to negotiate them one by one. The order in whic...
106
Voted
STACS
2001
Springer
15 years 5 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...