9842 search results - page 1667 / 1969 » The Complexity of the Matching-Cut Problem |
146
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
147
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
140
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
158
click to vote
AGENTS
2001
Springer
15 years 9 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
182
click to vote
FOSSACS
2001
Springer
15 years 9 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...