2373 search results - page 119 / 475 » Complexities for generalized models of self-assembly |
130
click to vote
JAIR
2006
15 years 4 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
146
click to vote
EICS
2009
ACM
15 years 9 months ago
2009
ACM
Complex and dynamic interaction behaviors in applications such as Virtual Reality (VR) systems are difficult to design and develop. Reasons for this include the complexity and lim...
150
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
153
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
126
click to vote
INFORMATICALT
2007
15 years 4 months ago
2007
In this article we present the general architecture of a hybrid neuro-symbolic system for the selection and stepwise elimination of predictor variables and non-relevant individuals...