3008 search results - page 576 / 602 » Independence in connected graphs |
150
click to vote
AOSD
2010
ACM
16 years 1 months ago
2010
ACM
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
152
click to vote
BIRTHDAY
2009
Springer
16 years 29 days ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
145
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
174
click to vote
ATAL
2009
Springer
16 years 23 days ago
2009
Springer
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
170
click to vote
CONCUR
2009
Springer
16 years 23 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...