Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,771 papers from all fields of science
Search
Sign In
Create Free Account
Procedural generation
Known as:
Procedural content generation
, Randomly generation
, Procedural rendering
Expand
In computing, procedural generation is a method of creating data algorithmically as opposed to manually. In computer graphics, it is also called…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
.kkrieger
A Valley Without Wind
Abyss Odyssey
Artificial intelligence (video games)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Some Computational Results on MPI Parallel Implementation of Dense Simplex Method
El-Said Badr
,
M. Moussa
,
K. Paparrizos
,
N. Samaras
,
Angelo Sifaleras
2008
Corpus ID: 12388397
There are two major variants of the Simplex Algorithm: the revised method and the standard, or tableau method. Today, all serious…
Expand
2007
2007
Solving the Satisfiability Problem Using Finite Learning Automata
Ole-Christoffer Granmo
,
N. Bouhmala
International Journal of Computer Science and…
2007
Corpus ID: 17917274
A large number of problems that occur in knowledge -representation, learning, VLSI-design, and other areas of artificial…
Expand
2006
2006
Static Task Scheduling with a Unified Objective on Time and Resource Domains
Betül Demiröz
,
H. Topcuoglu
Computer/law journal
2006
Corpus ID: 16556456
Task scheduling for parallel and distributed systems is an NP-complete problem, which is well documented and studied in the…
Expand
2002
2002
Prevention of early convergence in genetic programming by replacement of similar programs
V. Ciesielski
,
D. Mawhinney
Proceedings of the Congress on Evolutionary…
2002
Corpus ID: 61118562
We have investigated an approach to preventing or minimising the occurrence of premature convergence by measuring the similarity…
Expand
2000
2000
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)
G. Klau
,
K. Klein
,
Petra Mutzel
International Symposium Graph Drawing and Network…
2000
Corpus ID: 27696904
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given…
Expand
1998
1998
Stationary Policies in Multiechelon Inventory Systems with Deterministic Demand and Backlogging
Fang-Ruo Chen
Operational Research
1998
Corpus ID: 6535069
A stationary policy conducts replenishment activities-the placement and fulfillment of orders-in a stationary fashion. That is…
Expand
1996
1996
Context in Discrete Constraint Satisfaction Problems
R. Weigel
,
B. Faltings
,
B. Choueiry
European Conference on Artificial Intelligence
1996
Corpus ID: 10187178
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications…
Expand
Highly Cited
1995
Highly Cited
1995
Efficient estimation of arc criticalities in stochastic activity networks
R. Bowman
1995
Corpus ID: 62087867
An algorithm is described for estimating arc and path criticalities in stochastic activity networks by combining Monte Carlo…
Expand
1993
1993
Dynamic programming parallel implementations for the knapsack problem
R. Andonov
,
Frédéric Raimbault
,
P. Quinton
1993
Corpus ID: 6694533
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The algorithm can run on any…
Expand
1989
1989
Efficient robot inverse and direct dynamics algorithms using microcomputer based symbolic generation
R. Toogood
Proceedings, International Conference on…
1989
Corpus ID: 20432644
A method is described for automatically generating FORTRAN code for the inverse and direct dynamics solution of robot…
Expand