130 search results - page 26 / 26 » The Complexity of Optimal Planning and a More Efficient Meth... |
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
ALMOB
2006
13 years 7 months ago
2006
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
BMCBI
2010
13 years 7 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
SC
2009
ACM
14 years 1 months ago
2009
ACM
The UNIC code is being developed as part of the DOE’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. UNIC is an unstructured, deterministic neutron transport c...