Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Closure problem

In graph theory and combinatorial optimization, a closure of a directed graph is a set of vertices with no outgoing edges.That is, the graph should… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Abstract. We analyzed the seasonal variations of energy balance components over three different surfaces: irrigated cropland… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The ADVEX project involved conducting extensive advection measurements at three sites, each with a different topography. One goal… Expand
  • table 1
  • table 2
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present a complete 3D in-hand scanning system that allows users to scan objects by simply turning them freely in front of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
One solution to the timing closure problem is to perform infrequent operations in more than one cycle. Despite simplicity of the… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 7
  • figure 11
Is this relevant?
Highly Cited
2006
Highly Cited
2006
After briefly discussing several reasons for the energy balance closure problem in the surface layer, the paper focuses on the… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper discusses the recursive Bayesian formulation of the simultaneous localization and mapping (SLAM) problem in which… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract A wavenumber-frequency spectrum analysis is performed for all longitudes in the domain 15°S–15°N using a long (∼18 years… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 8
  • figure 9
Is this relevant?
1997
1997
This article formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem… Expand
  • figure I
  • table 3
  • table 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1949
Highly Cited
1949
T n "0 We shall denote by Cf and C$ the closed linear manifolds spanned by { f}o and {T*'g}o, respectively; f , g being elements… Expand
Is this relevant?