Skip to search formSkip to main contentSkip to account menu

Procedural generation

Known as: Procedural content generation, Randomly generation, Procedural rendering 
In computing, procedural generation is a method of creating data algorithmically as opposed to manually. In computer graphics, it is also called… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
.kkriegerA Valley Without WindAbyss OdysseyArtificial intelligence (video games)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Random Binary Code Generation Using Dark-Bright Soliton Conversion Control Within a PANDA Ring Resonator
In this paper, we have derived and presented the dynamic behavior of dark-bright soliton collision within the modified add/drop… 
Highly Cited
2008
Highly Cited
2008
Least-Squares based channel estimation for MIMO relays
A least-squares based channel estimation algorithm is proposed for relay-assisted wireless multiple-input multiple-output (MIMO… 
Highly Cited
2005
Highly Cited
2005
Efficient gathering of correlated data in sensor networks
In this paper, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence… 
Highly Cited
2004
Highly Cited
2004
Perception of Partly Occluded Objects and Illusory Figures : Evidence for an Identity Hypothesis
Three experiments test the hypothesis that perception of partly occluded figures (POFs) and illusory figures (IPs) derive from a… 
Highly Cited
2003
Highly Cited
2003
Flow shop scheduling problem with limited machine availability: A heuristic approach
Highly Cited
2002
Highly Cited
2002
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Highly Cited
2000
Highly Cited
2000
Optimal routing and wavelength assignment in WDM ring networks
We consider the routing and wavelength assignment (RWA) problem on WDM ring networks without wavelength conversion. When the… 
Highly Cited
2000
Highly Cited
2000
A Lagrangian relaxation approach to multi-period inventory/distribution planning
We consider a multi-period inventory/distribution planning problem (MPIDP) in a one-warehouse multiretailer distribution system… 
Highly Cited
1992
Highly Cited
1992
A branch and bound algorithm for the maximum clique problem
Highly Cited
1986
Highly Cited
1986
Optimal partitioning of randomly generated distributed programs
An investigation is made of an optimal task-assignment policy for a random-graph model of a distributed program. The model of the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)