2272 search results - page 71 / 455 » Capture Complexity by Partition |
107
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
ISPASS
2010
IEEE
15 years 4 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
HAPTICS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we present a software approach to managing complexity for haptic rendering of large-scale geometric models, consisting of tens to hundreds of thousands of distinct g...
ICDT
1997
ACM
15 years 1 months ago
1997
ACM
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
COR
2008
14 years 9 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...