13841 search results - page 2709 / 2769 » Algorithms and Constraint Programming |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
119
click to vote
DIS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
127
click to vote
IFM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
105
click to vote
ISSRE
2010
IEEE
14 years 11 months ago
2010
IEEE
—Database-centric applications (DCAs) are common in enterprise computing, and they use nontrivial databases. Testing of DCAs is increasingly outsourced to test centers in order t...
122
click to vote
JACM
2010
14 years 11 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...