[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Ayari et al., 2010 - Google Patents

A hybrid genetic algorithm for Golomb ruler problem

Ayari et al., 2010

View PDF
Document ID
14466168174894327252
Author
Ayari N
Van Luong T
Jemai A
Publication year
Publication venue
ACS/IEEE International Conference on Computer Systems and Applications-AICCSA 2010

External Links

Snippet

In recent years, with the massive use of Golomb rulers in various fields of engineering, new optimal rulers have become an important subject of search. Many different approaches have been proposed to tackle the Golomb ruler problem such as exact methods, constraint …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/70—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds
    • G06F19/708—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds for data visualisation, e.g. molecular structure representations, graphics generation, display of maps or networks or other visual representations

Similar Documents

Publication Publication Date Title
Wang et al. Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems
Hordijk et al. Mechanisms of emergent computation in cellular automata
Xu et al. GASTS: Parsimony scoring under rearrangements
Surynek On propositional encodings of cooperative path-finding
CN102594909A (en) Multi-objective community detection method based on spectrum information of common neighbour matrix
Ayari et al. A hybrid genetic algorithm for Golomb ruler problem
Bergman et al. Decision diagram decomposition for quadratically constrained binary optimization
Žnidarič Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Yi et al. Solving flexible job shop scheduling using an effective memetic algorithm
Kapsalis et al. The radio link frequency assignment problem: A case study using genetic algorithms
Blelloch et al. Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Berden et al. Learning max-sat models from examples using genetic algorithms and knowledge compilation
Jose et al. Towards a hybrid approach for evolving Bayesian networks using genetic algorithms
Maity et al. Rough genetic algorithm for constrained solid TSP with interval valued costs and times
Consoli et al. Heuristic approaches for the quartet method of hierarchical clustering
Hou et al. Solving Multi-objective School Bus Routing Problem Using An Improved NSGA-II Algorithm
Purshouse et al. Elitism, Sharing and Ranking Choices in Evolutionary Multi-Criterion Optimisation
Kowol et al. Agent-based evolutionary computing for difficult discrete problems
Kokosiński et al. Efficient graph coloring with parallel genetic algorithms
Turco Metahybrid: Combining metamodels and gradient-based techniques in a hybrid multi-objective genetic algorithm
Drugan Stochastic pareto local search for many objective quadratic assignment problem instances
El Fahim An Iterated Local Search with Multiple Perturbation Operators and a Varying Perturbation Strength for the Capacitated Team Orienteering Problem with Time Windows
Bokan et al. SLOPE: Search with Learned Optimal Pruning-based Expansion
US20240184626A1 (en) Processing system, processing method, and processing program
Day et al. An effective explicit building block MOEA, the MOMGA-IIa