Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,502,005 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.
Highly Cited
2010
Highly Cited
2010
Random Binary Code Generation Using Dark-Bright Soliton Conversion Control Within a PANDA Ring Resonator
Thanawat Phatharaworamet
,
C. Teeka
,
Rangsan Jomtarak
,
S. Mitatha
,
P. Yupapin
Journal of Lightwave Technology
2010
Corpus ID: 40161825
In this paper, we have derived and presented the dynamic behavior of dark-bright soliton collision within the modified add/drop…
Expand
Highly Cited
2008
Highly Cited
2008
Least-Squares based channel estimation for MIMO relays
Panagiota Lioliou
,
M. Viberg
International ITG Workshop on Smart Antennas
2008
Corpus ID: 21678457
A least-squares based channel estimation algorithm is proposed for relay-assisted wireless multiple-input multiple-output (MIMO…
Expand
Highly Cited
2007
Highly Cited
2007
Localized Movement Control for Fault Tolerance of Mobile Robot Networks
S. Das
,
Hai Liu
,
Ajith Kamath
,
A. Nayak
,
I. Stojmenovic
WSAN
2007
Corpus ID: 918319
In this paper, we present a novel localized movement control algorithm to form a fault-tolerant bi-connected robotic network…
Expand
Highly Cited
2004
Highly Cited
2004
Perception of Partly Occluded Objects and Illusory Figures : Evidence for an Identity Hypothesis
T. Shipley
,
P. Kellman
2004
Corpus ID: 14791860
Three experiments test the hypothesis that perception of partly occluded figures (POFs) and illusory figures (IPs) derive from a…
Expand
Highly Cited
2003
Highly Cited
2003
Flow shop scheduling problem with limited machine availability: A heuristic approach
R. Aggoune
,
M. Portmann
2003
Corpus ID: 62204641
Highly Cited
2000
Highly Cited
2000
Optimal routing and wavelength assignment in WDM ring networks
Taehan Lee
,
Kyungsik Lee
,
Sungsoo Park
IEEE Journal on Selected Areas in Communications
2000
Corpus ID: 15387395
We consider the routing and wavelength assignment (RWA) problem on WDM ring networks without wavelength conversion. When the…
Expand
Highly Cited
2000
Highly Cited
2000
A Lagrangian relaxation approach to multi-period inventory/distribution planning
Jung-Ug Kim
,
Yeong-Dae Kim
Journal of the Operational Research Society
2000
Corpus ID: 62674013
We consider a multi-period inventory/distribution planning problem (MPIDP) in a one-warehouse multiretailer distribution system…
Expand
Review
1998
Review
1998
Copyright protection of digital images by embedded unperceivable marks
M. Barni
,
F. Bartolini
,
V. Cappellini
,
A. Piva
Image and Vision Computing
1998
Corpus ID: 16097442
1997
1997
Topological Design of Two-Level Telecommunication Networks with Modular Switches
S. Chamberland
,
B. Sansò
,
O. Marcotte
Operational Research
1997
Corpus ID: 40769278
In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches…
Expand
Highly Cited
1986
Highly Cited
1986
Optimal partitioning of randomly generated distributed programs
B. Indurkhya
,
H. Stone
,
Xi-Cheng Lu
IEEE Transactions on Software Engineering
1986
Corpus ID: 9609443
An investigation is made of an optimal task-assignment policy for a random-graph model of a distributed program. The model of the…
Expand
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)
ACCEPT & CONTINUE