Sciweavers

644 search results - page 48 / 129
» Decomposition Complexity
Sort
View
CACM
2006
95views more  CACM 2006»
15 years 20 days ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
94
Voted
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
15 years 7 months ago
Compositional Models for Reinforcement Learning
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
Nicholas K. Jong, Peter Stone
WG
2009
Springer
15 years 7 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
ESEC
1997
Springer
15 years 4 months ago
Executable Connectors: Towards Reusable Design Elements
The decomposition of a software application into components and connectors at the design stage has been promoted as a way to describe and reason about complex software architecture...
Stéphane Ducasse, Tamar Richner
84
Voted
SOFSEM
2005
Springer
15 years 6 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender