„algorithm complexity“

Suchergebnisse

4.228 Treffer

• An algorithm portfolio for the dynamic maximal covering location problem
  Calderín, Jenny Fajardo ; Masegosa, Antonio D. ; Pelta, David A.
• Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems
  Wang, Gai-Ge
• Matrix rigidity of random Toeplitz matrices
  Goldreich, Oded ; Tal, Avishay
• Topological lower bounds for arithmetic networks
  Gabrielov, Andrei ; Vorobjov, Nicolai
• Switching error concealment algorithm based on optimal decisions for performance and complexity
  Lin, Ting-Lan ; Chen, Wen-Chih ; Fan, Chang-Yi ; Lee, Hsin-Chin ; Ding, Tsai-Ling ; Wang, Chuan-Jia ; Chen, Shih-Lun ; Hsia, Chih-Hsien
• Non-revisiting genetic algorithm with adaptive mutation using constant memory
  Lou, Yang ; Yuen, Shiu Yin
• Special Issue on the 10th Theory of Cryptography Conference: Editor’s Foreword
  Goldreich, Oded
• Cryptographic Hardness of Random Local Functions – Survey
  Applebaum, Benny
• Fine-Grained Access Control Within NoSQL Document-Oriented Datastores
  Colombo, Pietro ; Ferrari, Elena
• Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
  Doerr, Benjamin ; Neumann, Frank ; Sutton, Andrew M.
• Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
  Baswana, Surender ; Khan, Shahbaz
• Populations Can Be Essential in Tracking Dynamic Optima
  Dang, Duc-Cuong ; Jansen, Thomas ; Lehre, Per Kristian
• Development of a voltage-dependent current noise algorithm for conductance-based stochastic modelling of auditory nerve fibres
  Badenhorst, Werner ; Hanekom, Tania ; Hanekom, Johan J.
• Partition based real-valued encoding scheme for evolutionary algorithms
  Font, Jose M. ; Manrique, Daniel ; Ramos-Criado, Pablo ; Rio, David del
• Software cost estimation based on modified K-Modes clustering Algorithm
  Bishnu, Partha Sarathi ; Bhattacherjee, Vandana
• Formal Modelling of Data Integration Systems Security Policies
  Akeel, Fatimah ; Salehi Fathabadi, Asieh ; Paci, Federica ; Gravell, Andrew ; Wills, Gary
• Efficiently Correcting Matrix Products
  Ga̧sieniec, Leszek ; Levcopoulos, Christos ; Lingas, Andrzej ; Pagh, Rasmus ; Tokuyama, Takeshi
• Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
  Jansen, Bart M. P. ; Pieterse, Astrid
• Non-commutative Edmonds’ problem and matrix semi-invariants
  Ivanyos, Gábor ; Qiao, Youming ; Subrahmanyam, K. V.
• On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation
  Corus, Dogan ; He, Jun ; Jansen, Thomas ; Oliveto, Pietro S. ; Sudholt, Dirk ; Zarges, Christine