Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

VEGAS -- a new genetic algorithm for satisfiability

From MaRDI portal
Publication:3450101
Jump to:navigation, search

zbMATH Open1323.68467MaRDI QIDQ3450101FDOQ3450101

E. S. Skvortsov

Publication date: 2 November 2015





Recommendations

  • Artificial Intelligence and Soft Computing - ICAISC 2004
  • scientific article; zbMATH DE number 1961995
  • Problem structure heuristics and scaling behavior for genetic algorithms
  • scientific article; zbMATH DE number 1844518
  • A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem


Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)



Cited In (5)

  • Artificial Intelligence and Soft Computing - ICAISC 2004
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem





This page was built for publication: VEGAS -- a new genetic algorithm for satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450101)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3450101&oldid=16765691"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 19:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki