A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
K-Adaptability in Two-Stage Robust Binary Programming

2015
*
Operations Research
*

We propose to approximate two-stage distributionally robust

doi:10.1287/opre.2015.1392
fatcat:jgb7fdin2rebfjkrqndeqbffz4
*programs*with*binary*recourse decisions by their associated K-*adaptability*problems, which pre-select K candidate secondstage policies here-and-now ... We assume that all components of y are*binary*, while x may have continuous as well as*binary*components. ... The The K-*adaptability*formulation (4) corresponding to the vertex packing problem has O(KN )*binary*variables. ...##
###
Adaptive Memory Tabu Search for Binary Quadratic Programs

1998
*
Management science
*

In this paper we describe the development and use of such an approach to solve

doi:10.1287/mnsc.44.3.336
fatcat:5x6lx3bo6zgr3im3z735nthrwm
*binary*quadratic*programs*. ... R ecent studies have demonstrated the effectiveness of applying*adaptive*memory tabu search procedures to combinatorial optimization problems. ... In this paper we present a tabu search implementation designed to solve the*binary*quadratic*program*: QP: max x Å xAx, 0 where x is a zero-one vector. ...##
###
Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes

2012
*
IEEE Transactions on Information Theory
*

Linear

doi:10.1109/tit.2012.2204955
fatcat:fw7rttjlzrdejkor2fo3ekw2xe
*programming*(LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer*programming*(IP) problem into a more easily solved LP problem ... together with a set of linear inequalities called "parity inequalities" that are derived from the constraints represented by the rows of a parity-check matrix of the code and can be added iteratively and*adaptively*... LINEAR*PROGRAMMING*DECODING AND*ADAPTIVE*VARIANTS A. ...##
###
K-adaptability in two-stage distributionally robust binary programming

2016
*
Operations Research Letters
*

We propose to approximate two-stage distributionally robust

doi:10.1016/j.orl.2015.10.006
fatcat:l2wygacgtjhg7fumui5cltnsh4
*programs*with*binary*recourse decisions by their associated K-*adaptability*problems, which pre-select K candidate secondstage policies here-and-now ... We assume that all components of y are*binary*, while x may have continuous as well as*binary*components. ... Using the worst-case conditional value-at-risk as a risk measure, the problem can be formulated as a distributionally robust two-stage*binary**program*with objective uncertainty: maximize inf P∈P P-CVaR ...##
###
Binary decision rules for multistage adaptive mixed-integer optimization

2017
*
Mathematical programming
*

Decision rules provide a flexible toolbox for solving computationally demanding, multistage

doi:10.1007/s10107-017-1135-6
fatcat:xc3s3itcpzeireqjpz36lv6fhy
*adaptive*optimization problems. ... To address these issues, we first propose a linearly parameterised*binary*decision rule structure and derive the exact reformulation of the decision rule problem. ... Non-*Adapt*. , where Non-*Adapt*. and*Adapt*. are the objective values of the non-*adaptive*and*adaptive**binary*decision rule problems, respectively. ...##
###
Easy-to-Use On-the-Fly Binary Program Acceleration on Many-Cores
[article]

2014
*
arXiv
*
pre-print

This paper introduces

arXiv:1412.3906v1
fatcat:g5okuztqpnbshkojxg57yiodmu
*Binary*Acceleration At Runtime (BAAR), an easy-to-use on-the-fly*binary*acceleration mechanism which aims to tackle the problem of enabling existent software to automatically utilize ... The client runs the*program*to be accelerated in an environment which allows*program*analysis and profiling. ... For ispc, the*program*source code has to be available and*adapted*. Once compiled, there is no way of*adapting*the*binary**program*to changing environments. ...##
###
Adaptive cut generation for improved linear programming decoding of binary linear codes

2011
*
2011 IEEE International Symposium on Information Theory Proceedings
*

*Adaptive*linear

*programming*(ALP) decoding significantly reduces the complexity of LP decoding by iteratively and

*adaptively*adding necessary constraints in a sequence of smaller LP problems. ... Linear

*programming*(LP) decoding approximates optimal maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer

*programming*(IP) problem into a more easily solved LP ... In [3] , Taghavi and Siegel introduced an

*adaptive*linear

*programming*(ALP) decoder in which these constraints are added in an

*adaptive*and selective way. ...

##
###
Post-pass binary adaptation for software-based speculative precomputation

2002
*
Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02
*

SSP does not require expensive hardware support-instead it relies on the compiler to

doi:10.1145/512529.512544
dblp:conf/pldi/LiaoWWSHL02
fatcat:hidw6rtajfd5vffdg2havbqi4e
*adapt**binaries*to perform prefetching on otherwise idle hardware thread contexts at run time. ... The aim of this paper is to demonstrate the feasibility of automatically generating*binaries*for thread-based prefetching and the effectiveness of the resulting*binaries*. ... In contrast, we use the automated*binary**adaptation*tool to enhance the*binary*for SSP. We compare the performance of both approaches on the same simulator. ...##
###
Post-pass binary adaptation for software-based speculative precomputation

2002
*
Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02
*

SSP does not require expensive hardware support-instead it relies on the compiler to

doi:10.1145/512541.512544
fatcat:nshqi5hd4rh2jbrrzpodutdw5y
*adapt**binaries*to perform prefetching on otherwise idle hardware thread contexts at run time. ... The aim of this paper is to demonstrate the feasibility of automatically generating*binaries*for thread-based prefetching and the effectiveness of the resulting*binaries*. ... In contrast, we use the automated*binary**adaptation*tool to enhance the*binary*for SSP. We compare the performance of both approaches on the same simulator. ...##
###
Fast and accurate solution for the SCUC problem in large-scale power systems using adapted binary programming and enhanced dual neural network

2014
*
Energy Conversion and Management
*

To solve the nonconvex problem, an

doi:10.1016/j.enconman.2013.11.004
fatcat:mif7eeyolnfwlblijx6ujdt5x4
*adapted**binary**programming*method and enhanced dual neural network model are utilized as optimization tools, and a procedure for AC power flow modelling is developed ... The novel hybrid method proposed in this paper for solving the SCUC problem is based on the combination of*adapted**binary**programming*(ABP) with enhanced dual neural network (EDNN). ... In [15] , an*adaptive*hybrid stochastic search technique has been described, consisting of an*adaptive**binary*particle swarm optimization (ABPSO) and an*adaptive*real coded genetic algorithm (ARCGA). ...##
###
Binary component adaptation
[chapter]

1998
*
Lecture Notes in Computer Science
*

*Binary*component

*adaptation*(BCA) allows components to be

*adapted*and evolved in

*binary*form and on-the-fly (during

*program*loading). ... With its flexibility, relative simple implementation, and low overhead,

*binary*component

*adaptation*could significantly improve the reusability of Java components. ... Thus, categories allow class

*adaptations*similar to

*binary*component

*adaptation*. ...

##
###
Rapid Real-Time Interdisciplinary Ocean Forecasting Using Adaptive Sampling and Adaptive Modeling and Legacy Codes: Component Encapsulation Using XML
[chapter]

2003
*
Lecture Notes in Computer Science
*

We present the high level architecture of a real-time interdisciplinary ocean forecasting system that employs

doi:10.1007/3-540-44864-0_39
fatcat:yi4acglphrde3axhqe2dgl63su
*adaptive*elements in both modeling and sampling. ... We present a method that uses XML documents to describe the parameters for executing a*binary*. ... Another approach compatible with stand-alone*binaries*involves wrapping at the*binary*level, preparing the input files and arguments to the*binary*, executing the*program*and capturing and interpreting ...##
###
Software-Based Fault Recovery via Adaptive Diversity for COTS Multi-Core Processors
[article]

2015
*
arXiv
*
pre-print

This is achieved by

arXiv:1511.03528v2
fatcat:rpzrib7tsjdazhk243cahzzjwq
*adapting*the software execution in such a way that permanent faults are mitigated. ... The main idea is to*adapt*the execution of the diverse*program*replicas in such a way that a permanent hardware fault is bypassed. II. BACKGROUND AND RELATED WORK A. ... First, we try to*adapt*the execution with*adaptive*dynamic diversity methods (4)(5). ...##
###
Optimal Context Quantization in Lossless Compression of Image Data Sequences

2004
*
IEEE Transactions on Image Processing
*

For a

doi:10.1109/tip.2003.822613
pmid:15376585
fatcat:spslvcogtfcwvckzga5ikn35um
*binary*source alphabet an optimal context quantizer can be computed exactly by a fast dynamic*programming*algorithm. Faster approximation solutions are also proposed. ... The optimality of context quantization is defined to be the minimum static or minimum*adaptive*code length of given a data set. ... Index Terms-*Adaptive*code length, context modeling, context quantization, dynamic*programming*, entropy coding. I. ...##
###
Materials Review

2019
*
IALLT Journal of Language Learning Technologies
*

In

doi:10.17161/iallt.v7i2.8857
fatcat:67s2ajqao5fxvpykihnood2s2q
*program*production and*adaptation*,*binary*flow diagrams are means of working with individual aspects of language and are dependent upon the native and target languages concerned. ... In Bung's work this progression is built up in branches which are called "*binary*flow diagrams". These are*adaptations*of mathematical algorithms. ...
« Previous

*Showing results 1 — 15 out of 359,622 results*