Sciweavers

3116 search results - page 146 / 624
» Recovering
Sort
View
SIAMJO
2002
100views more  SIAMJO 2002»
13 years 9 months ago
Warm-Start Strategies in Interior-Point Methods for Linear Programming
Abstract. We study the situation in which, having solved a linear program with an interiorpoint method, we are presented with a new problem instance whose data is slightly perturbe...
E. Alper Yildirim, Stephen J. Wright
SIGPLAN
2002
13 years 9 months ago
Trace analysis of Erlang programs
The paper reports on an experiment to provide the Erlang programming language with a tool package for convenient trace generation, collection and to support analysis of traces usi...
Thomas Arts, Lars-Åke Fredlund
ISMM
2009
Springer
14 years 3 months ago
Some Morphological Operators in Graph Spaces
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
Jean Cousty, Laurent Najman, Jean Serra
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
A Generalized Sampling Theorem for Reconstructions in Arbitrary Bases
—We present a generalized sampling theorem allowing reconstructions in arbitrary bases. The classical Shannon Sampling Theorem is a special case of our theorem. Specifically, we...
Ben Adcock, Anders C. Hansen
ICARIS
2010
Springer
13 years 7 months ago
A Developmental and Immune-Inspired Dynamic Task Allocation Algorithm for Microprocessor Array Systems
Abstract. This paper presents a high level dynamic task allocation algorithm that is inspired by the biological development process and the immune system. For a microprocessor (µP...
Yang Liu, Jon Timmis, Omer Qadir, Gianluca Tempest...