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
2006
Highly Cited
2006
Nash equilibria of packet forwarding strategies in wireless ad hoc networks
In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example… 
Highly Cited
2006
Highly Cited
2006
A community based mobility model for ad hoc network research
Validation of mobile ad hoc network protocols relies almost exclusively on simulation. The value of the validation is, therefore… 
Highly Cited
2003
Highly Cited
2003
How should environmental stress affect the population dynamics of disease
We modelled how stress affects the population dynamics of infectious disease. We were specifically concerned with stress that… 
Highly Cited
2000
Highly Cited
2000
Performance criteria for graph clustering and Markov cluster experiments
In~[1] a cluster algorithm for graphs was introduced called the Markov cluster algorithm or MCL~algorithm. The algorithm is based… 
Highly Cited
1999
Highly Cited
1999
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with… 
Highly Cited
1990
Highly Cited
1990
On the complexity of mod-2l sum PLA's
Consideration is given to the realization of logic functions by using PLAs with an exclusive-OR (EXOR) array, where a function is… 
Highly Cited
1987
Highly Cited
1987
Throughput Analysis in Multihop CSMA Packet Radio Networks
In this paper, we use a Markov model to develop a product form solution to efficiently analyze the throughput of arbitrary… 
Highly Cited
1986
Highly Cited
1986
NLPQL: A fortran subroutine solving constrained nonlinear programming problems
NLPQL is a FORTRAN implementation of a sequential quadratic programming method for solving nonlinearly constrained optimization… 
Highly Cited
1981
Highly Cited
1981
PSYCHOMUSICOLOGY Spring 1981 THE IMPORTANCE OF 'INTERVAL INFORMATION IN LONG-TERM MEMORY FOR MELODIES
Four experiments examined the roles of melodic contour and pitch in­ terval information in recognition memory for melodies. In… 
Highly Cited
1979
Highly Cited
1979
Performance measurement and analysis of certain search algorithms.
Abstract : This thesis applies the methodology of analysis of algorithms to study certain combinatorial problems and search… 
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)