13621 search results - page 24 / 2725 » Computability and Complexity in Self-assembly |
EOR
2002
13 years 9 months ago
2002
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
MST
2011
13 years 4 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
ECWEB
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
FSTTCS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
APL
1998
ACM
14 years 2 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...