1161 search results - page 101 / 233 » Kinetic Dependence Graphs |
CIG
2005
IEEE
15 years 6 months ago
2005
IEEE
AbstractWe describe Utile Coordination, an algorithm that allows a multiagent system to learn where and how to coordinate. The method starts with uncoordinated learners and maintai...
111
Voted
DMDW
2001
15 years 2 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
102
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
104
Voted
ISPASS
2006
IEEE
15 years 6 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...