150 search results - page 10 / 30 » Counting Results in Weak Formalisms |
FUIN
2008
13 years 8 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
ISCA
1996
IEEE
14 years 28 days ago
1996
IEEE
Many studies have investigated performance improvement through exploiting instruction-level parallelism (ILP) with a particular architecture. Unfortunately, these studies indicate...
FORMATS
2009
Springer
14 years 20 days ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Whereas search engines assist users in locating initial information sources, often an overwhelmingly large number of ULRs is returned, and the task of browsing websites rests heavi...