1782 search results - page 243 / 357 » Learning in Parallel Universes |
137
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
138
click to vote
ASPLOS
1989
ACM
15 years 8 months ago
1989
ACM
A very long instruction word (VLIW) processorexploits parallelism by controlling multiple operations in a single instruction word. This paper describes the architecture and compil...
125
click to vote
CTCS
1989
Springer
15 years 8 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
119
click to vote
AAAI
2008
15 years 6 months ago
2008
ar for abstract concepts, and a number of formally expressed, structural restrictions. Copyright c 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). ...
160
click to vote
ISCAPDCS
2004
15 years 5 months ago
2004
This paper describes a collaboration among computer scientists, dancers, and musicians on a production entitled "Fibonacci and Phi." Thematically, the production explore...