Sciweavers

1258 search results - page 134 / 252
» Architecture-driven Problem Decomposition
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 2 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
14 years 3 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
SOFSEM
2005
Springer
14 years 2 months ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
AMDO
2004
Springer
14 years 2 months ago
Neuroanatomy Registration: An Algebraic-Topology Based Approach
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
Layachi Bentabet, Djemel Ziou