492 search results - page 47 / 99 » Perfect Matching Preservers |
100
click to vote
ESAW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In open agent societies, communication protocols and strategies cannot be assumed to always match perfectly, because they are typically specified by different designers...
ICDCSW
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing intere...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
102
click to vote
DAC
2000
ACM
15 years 4 months ago
2000
ACM
Abstract: This paper presents a new statistical methodology to simulate the effect of both inter-die and intra-die variation on the electrical performance of analog integrated circ...
103
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...