195 search results - page 29 / 39 » The incomplete fixation measure |
FLAIRS
2003
13 years 9 months ago
2003
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
AAAI
2000
13 years 9 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
IJAR
2008
13 years 7 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
CCE
2004
13 years 7 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
CPHYSICS
2004
13 years 7 months ago
2004
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...