4539 search results - page 699 / 908 » Approaches to Compute Workflow Complexity |
201
click to vote
IDA
2006
Springer
15 years 6 months ago
2006
Springer
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
176
click to vote
CLUSTER
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Software component technologies are being accepted as an adequate solution for handling the complexity of applications. However, existing software component models tend...
139
click to vote
COR
2007
15 years 6 months ago
2007
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
161
click to vote
JCM
2008
15 years 6 months ago
2008
Power consumption is a critical issue for many applications running on autonomous battery operated devices. In the context of low power communications, the use of Forward Error Cor...
173
click to vote
JAIR
2006
15 years 6 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...