6142 search results - page 208 / 1229 » The Complexity of Partition Functions |
131
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
132
Voted
ISLPED
1995
ACM
15 years 7 months ago
1995
ACM
Thispaper proposes a method for achieving low-power control-logic modules using a combination of CMOS complex gate reorganization, transistor size optimization, and transistor lay...
96
Voted
AIIDE
2008
15 years 6 months ago
2008
It is difficult to discover effective behavior for NPCs automatically. For instance, evolutionary methods can learn sophisticated behaviors based on a single objective, but realis...
112
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
153
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...