Sciweavers

376 search results - page 50 / 76
» General Reversibility
Sort
View
SIAMJO
2011
13 years 3 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
KDD
2008
ACM
121views Data Mining» more  KDD 2008»
14 years 9 months ago
Reconstructing chemical reaction networks: data mining meets system identification
We present an approach to reconstructing chemical reaction networks from time series measurements of the concentrations of the molecules involved. Our solution strategy combines t...
Yong Ju Cho, Naren Ramakrishnan, Yang Cao
ICSE
2004
IEEE-ACM
14 years 8 months ago
Toward Undoing in Composite Web Services
Cancelling or reversing the effect of a former action is a necessity in most interactive systems. The simplest and most frequent form of this facility is the "undo" comma...
Marie-Claude Gaudel
ICSE
2005
IEEE-ACM
14 years 8 months ago
Binary refactoring: improving code behind the scenes
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
Eli Tilevich, Yannis Smaragdakis
ICFP
2004
ACM
14 years 8 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch