Sciweavers

4894 search results - page 95 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
WWW
2004
ACM
16 years 7 months ago
Analysis of interacting BPEL web services
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...
Xiang Fu, Tevfik Bultan, Jianwen Su
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 8 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 3 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
SIAMSC
2010
120views more  SIAMSC 2010»
15 years 4 months ago
Simultaneously Sparse Solutions to Linear Inverse Problems with Multiple System Matrices and a Single Observation Vector
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
15 years 9 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...