We describe a variant of the well-known graph coloring problem (COL) which we are calling Continuous K-coloring (CONT-COL). This variant has certain properties that make it more amenable to measurement of the computational effort required to find solutions to instances of the problem. We describe the experiments to measure this which we are designing as well. The algorithm used for this purpose...

Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the contrary, build as simple as possible models focusing only on the core aspects of the process, in an effort to obtain a model that is easier to analyze, fit, and validate. When the latter strategy is adopted, the aspects that are ...

Future small unmanned aircraft systems (UAS) will require careful co-design over both physical and cyber elements to maximize total-system efficiency. Mission objectives and success of the system as a whole are becoming increasingly dependent on appropriate allocation of computational resources balanced against demands of the physical actuation systems. In this paper we describe a co-optimizati...

This paper presents a method for fast encoding of still images based on iterated function systems (IFSs). The major disadvantage of this coding approach, usually referred to as fractal coding, is the high computational effort of the encoding process compared to e.g. the JPEG algorithm [1]. This is mainly due to the costly “full search” of the transform parameters within a fractal codebook. We t...

We study a robust model of the multi-armed bandit (MAB) problem in which the transition probabilities are ambiguous and belong to subsets of the probability simplex. We first show that for each arm there exists a robust counterpart of the Gittens index that is the solution to a robust optimal stopping-time problem. We then characterize the optimal policy of the robust MAB as a project-by-projec...

Efficient convolutional coding and decoding algorithms are most crucial to successful operation of wireless communication systems in order to achieve high quality of service by reducing the overall bit error rate performance. A widely applied and well evaluated scheme for error correction purposes is well known as Viterbi algorithm [7]. Although the Viterbi algorithm has very good error correct...

Effective diagnosis of integrated circuits relies critically on the quality of diagnostic test vectors. Diagnostic test pattern generation aims at producing test vectors that distinguish between all distinguishable pairs of faults, and proving the remaining pairs of faults to be indistinguishable. Proving indistinguishabilities, much like proving undetectabilities in the case of detection-orien...

Learning to learn approaches can be used to train a recurrent neural network (RNN) that learns an optimization algorithm. Adaptive computation time for RNNs allows a network to adjust its depth at each time step to the input received so far. In this work we developed two adaptive meta-learners that combine the learning to learn and adaptive computation time approaches in order to optimize loss ...