Decomposition (computer science)

Known as: Decomposition in programming, Algorithmic decomposition, Decomposition diagram 
Decomposition in computer science, also known as factoring, is breaking a complex problem or system into parts that are easier to conceive… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
0102019742017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
We present a taxonomy for flexible flow line scheduling procedures. Flexible flow lines are flow lines with parallel machines on… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We argue that formal modeling should be the starting point for any serious development of computer systems. This claim poses a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the… (More)
  • figure 1
  • figure 3
  • table 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We are presently witnessing an important paradigm shift occurring in the area of information system construction, namely from… (More)
  • figure 2
  • figure 3
  • figure 1
  • figure 4
  • figure 6
Is this relevant?
1999
1999
Software engineering has been producing a number of models or modeling methods, e.g. the data flow model, the state transition… (More)
  • figure 1
Is this relevant?
1998
1998
We describe the architecture of the ILEX system, • which supports opportunistic text generation. In • web-based text generation… (More)
  • figure 3
Is this relevant?
1997
1997
Let D be a small category. Suppose that X̄ is a D-diagram in the homotopy category (in other words, a functor from D to the… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Models of large and complex systems can often be reduced to smaller sub-models, for easier analysis, by a process known as… (More)
  • figure 1
  • figure 1
  • figure 2
Is this relevant?