2373 search results - page 190 / 475 » Complexities for generalized models of self-assembly |
172
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
170
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
186
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
181
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
205
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...