Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Dear GEMS users, Discussions with and feedback from GEMS users revealed to us that some users use the system for analysis of extremely small sample datasets. A good heuristic rule for defining extremely small

Source URL: www.gems-system.org

• Statistical inference
• Estimation theory
• Cross-validation
• Machine learning
• Model selection
• Statistics
• Estimator
• Variance
• Resampling

Microsoft Word - BIOMA2016-Program.docx

Source URL: bioma.ijs.si

• Mathematical optimization
• Operations research
• Heuristics
• Cybernetics
• Applied mathematics
• Analysis
• Cognition
• Evolutionary algorithm
• Extremal optimization
• Global optimization
• Stochastic optimization
• Hyper-heuristic

A HEURISTIC FOR THE JOB SHOP SCHEDULING PROBLEM Hugo Zupan, Niko Herakoviˇc Faculty of Mechanical Engineering, University of Ljubljana, Slovenia ,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Search algorithms
• Combinatorial optimization
• Metaheuristics
• Job shop scheduling
• Heuristic
• Genetic algorithm
• Travelling salesman problem
• Constructive heuristic
• Ant colony optimization algorithms
• Algorithm

RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering

Source URL: grk1855.tu-dortmund.de

• Computational complexity theory
• Theory of computation
• Combinatorial optimization
• Complexity classes
• Operations research
• Integer programming
• Heuristic
• Branch and bound
• NP
• Optimization problem
• Pruning
• Reduction

Practical Divisible E-Cash Patrick Märtens Mathematisches Institut, Justus-Liebig-Universität Gießen April 9, 2015

Source URL: eprint.iacr.org

• Cryptography
• Public-key cryptography
• FiatShamir heuristic
• Wallet
• Advantage
• Accumulator
• Digital signature
• Coin

A HEURISTIC FOR BOUNDEDNESS OF RANKS OF ELLIPTIC CURVES JENNIFER PARK, BJORN POONEN, JOHN VOIGHT, AND MELANIE MATCHETT WOOD Abstract. We present a heuristic that suggests that ranks of elliptic curves E over Q are bounde

Source URL: math.dartmouth.edu

Digital Library Curriculum Development Module: 6-d: Interaction Design & Usability Assessment (Draft, Last Updated: )

Source URL: curric.dlib.vt.edu

• Usability
• Humancomputer interaction
• Technical communication
• Software testing
• Heuristic evaluation
• Cognitive walkthrough
• User interface design
• User-centered design
• Jakob Nielsen
• Interaction design
• User interface
• Think aloud protocol

A Heuristic Routing Mechanism Using a New Addressing Scheme M. Ravanbakhsh1, Y. Abbasi-Yadkori1, M. Abbaspour1,3, H. Sarbazi-Azad1,2 1 IPM, School of Computer Science, Tehran, Iran Department of Computer Engineering, Sha

Source URL: webdocs.cs.ualberta.ca

A Heuristic for the Prime Number Theorem This article appeared in The Mathematical Intelligencer 28:–9, and is copyright by SpringerVerlag. Posted with permission. Hugh L. Montgomery 1 , University of Michiga

Source URL: stanwagon.com