4539 search results - page 274 / 908 » Approaches to Compute Workflow Complexity |
165
click to vote
DATE
2006
IEEE
16 years 20 days ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
175
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
183
Voted
CCDS
2010
15 years 4 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
191
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
170
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
We present a simple and effective algorithm to transfer deformation between surface meshes with multiple components. The algorithm automatically computes spatial relationships bet...