950 search results - page 34 / 190 » Type Specialization in Aldor |
CSCW
2008
ACM
13 years 8 months ago
2008
ACM
People dynamically structure social interactions and activities at various locations in their environments in specialized types of places such as the office, home, coffee shop, mus...
EJC
2010
13 years 8 months ago
2010
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
MCS
2006
Springer
13 years 8 months ago
2006
Springer
8 The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be9 ill-conditioned and require special techniques. A robus...
MP
2006
13 years 8 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...