4539 search results - page 373 / 908 » Approaches to Compute Workflow Complexity |
169
click to vote
ISPE
2003
15 years 8 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
144
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
146
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
210
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
225
click to vote
FGR
2011
IEEE
14 years 10 months ago
2011
IEEE
— Despite major advances within the affective computing research field, modelling, analysing, interpreting and responding to naturalistic human affective behaviour still remains...