3229 search results - page 532 / 646 » The Theory of Timed Automata |
167
click to vote
DEDS
2007
15 years 6 months ago
2007
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
188
click to vote
JUCS
2008
15 years 6 months ago
2008
Abstract: Nowadays, in the markets of broadband access services, traditional contracts are of "static" type. Customers buy the right to use a specific amount of resources...
124
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
157
click to vote
JSAC
2006
15 years 5 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
172
click to vote
JUCS
2006
15 years 5 months ago
2006
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...