4539 search results - page 155 / 908 » Approaches to Compute Workflow Complexity |
79
Voted
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
57
Voted
ACG
2009
Springer
15 years 4 months ago
2009
Springer
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
100
Voted
DALT
2009
Springer
15 years 1 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
90
Voted
AGI
2008
14 years 11 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...