2612 search results - page 357 / 523 » Switching Graphs and Their Complexity |
144
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
132
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
109
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
132
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
120
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...