[go: up one dir, main page]

Benson et al., 1997 - Google Patents

Multiplicative programming problems: analysis and efficient point search heuristic

Benson et al., 1997

Document ID
3840375515396845439
Author
Benson H
Boger G
Publication year
Publication venue
Journal of Optimization Theory and Applications

External Links

Snippet

Multiplicative programming problems are difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, finance, economics, and other fields. This article has two purposes. The first is …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/36—Preventing errors by testing or debugging software
    • G06F11/3604—Software analysis for verifying properties of programs
    • G06F11/3612—Software analysis for verifying properties of programs by runtime analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3409—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment for performance assessment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/44—Arrangements for executing specific programmes
    • G06F9/4421—Execution paradigms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G06F8/42—Syntactic analysis
    • 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/10—Complex mathematical operations
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled

Similar Documents

Publication Publication Date Title
Benson et al. Multiplicative programming problems: analysis and efficient point search heuristic
Debray et al. Lower Bound Cost Estimation for Logic Programs.
Briggs et al. Value numbering
Ball The concept of dynamic analysis
Wilhelm et al. Shape analysis
Shapiro et al. Fast and accurate flow-insensitive points-to analysis
Tu et al. Efficient building and placing of gating functions
Mulvey Testing of a large-scale network optimization program
Olender et al. Interprocedural static analysis of sequencing constraints
Dan Lee et al. Constraint based mining of first order sequences in SeqLog
Comon Sequentiality, second order monadic logic and tree automata
Stoltz et al. Extended SSA with factored use-def chains to support optimization and parallelism
Denis et al. PAC learning with simple examples
Bendkowski Quantitative aspects and generation of random lambda and combinatory logic terms
Sahlin Determinacy analysis for full Prolog
Bertoni et al. Random generation and approximate counting of ambiguously described combinatorial structures
Tekle et al. Precise complexity guarantees for pointer analysis via datalog with extensions
Curien et al. Bistructures, bidomains and linear logic
Liu et al. Optimizing Ackermann's function by incrementalization
Drabent A note on occur-check
Bentley et al. An Alphard specification of a correct and efficient transformation on data structures
Gabow Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph
Curien et al. Bistructures, bidomains and linear logic
Arikawa et al. More about learning elementary formal systems
Scholz et al. Dataflow frequency analysis based on whole program paths