Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

José E Gallardo

Showing results (1-10 of 2) with videos related to

Pageof 1
Sort By:
Plos One|January 10, 2013
A multilevel probabilistic beam search algorithm for the shortest common supersequence problemJosé E Gallardo
IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society|February 7, 2007
On the hybridization of memetic algorithms with branch-and-bound techniquesJosé E Gallardo, Carlos Cotta, Antonio J Fernández
Pageof 1

Showing results (1-10 of 2) with videos related to

Sort By:
Pageof 1
Plos One|January 10, 2013
A multilevel probabilistic beam search algorithm for the shortest common supersequence problemJosé E Gallardo
IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society|February 7, 2007
On the hybridization of memetic algorithms with branch-and-bound techniquesJosé E Gallardo, Carlos Cotta, Antonio J Fernández
Pageof 1