1067 search results - page 82 / 214 » Probabilistic regular graphs |
103
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
126
Voted
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
105
Voted
STOC
2005
ACM
16 years 28 days ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
104
click to vote
CSR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
138
Voted
HEURISTICS
2006
15 years 18 days ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...