1477 search results - page 187 / 296 » Complexity of (iterated) dominance |
109
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
120
Voted
DAWAK
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
106
Voted
FM
2006
Springer
15 years 4 months ago
2006
Springer
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners adopt techniques that support partial behaviour...
101
click to vote
ISPD
1998
ACM
15 years 4 months ago
1998
ACM
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
122
Voted
VLDB
1987
ACM
15 years 4 months ago
1987
ACM
FAD is a powerful and simple language designed for a highly parallel database machine. The basic concepts of the language are its data structures (which we call objects) and its p...