Sciweavers

921 search results - page 61 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee
CCR
2004
147views more  CCR 2004»
13 years 7 months ago
Safe compositional specification of networking systems
The science of network service composition has emerged as one of the grand themes of networking research [17] as a direct result of the complexity and sophistication of emerging n...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
MFCS
2004
Springer
14 years 1 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
AI
2011
Springer
13 years 2 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
BMCBI
2010
84views more  BMCBI 2010»
13 years 8 months ago
An integrated analysis of molecular aberrations in NCI-60 cell lines
Background: Cancer is a complex disease where various types of molecular aberrations drive the development and progression of malignancies. Large-scale screenings of multiple type...
Chen-Hsiang Yeang