3267 search results - page 378 / 654 » Generalized quasirandom graphs |
167
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
153
click to vote
APN
2004
Springer
16 years 3 days ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
150
click to vote
ESA
2004
Springer
16 years 2 days ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
161
click to vote
FOSSACS
2004
Springer
16 years 2 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
165
click to vote
WWW
2010
ACM
16 years 27 min ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...