An explanation of ordinal optimization: Soft computing for hard problems (Q1818951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126322766, #quickstatements; #temporary_batch_1722855414894
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal optimization of DEDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal alignment probabilities and subset selection for ordinal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explanation of goal softening in ordinal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning of walking robots in environments with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convergence of ordinal comparison for dependent discrete event dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845326 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126322766 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:58, 5 August 2024

scientific article
Language Label Description Also known as
English
An explanation of ordinal optimization: Soft computing for hard problems
scientific article

    Statements