38 search results - page 5 / 8 » Multiple Relaxations in Temporal Planning |
LOGCOM
1998
13 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
BMCBI
2006
13 years 7 months ago
2006
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
ICCD
2008
IEEE
14 years 4 months ago
2008
IEEE
— Clock frequency and transistor density increases have resulted in elevated chip temperatures. In order to meet temperature constraints while still exploiting the performance op...
JMLR
2012
11 years 9 months ago
2012
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
SERVICES
2008
13 years 8 months ago
2008
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...