Sciweavers

2657 search results - page 248 / 532
» On the complexity of hierarchical problem solving
Sort
View
TIM
2010
112views Education» more  TIM 2010»
15 years 28 days ago
Helmholtz-Type Regularization Method for Permittivity Reconstruction Using Experimental Phantom Data of Electrical Capacitance T
Electrical capacitance tomography (ECT) attempts to image the permittivity distribution of an object by measuring the electrical capacitance between sets of electrodes placed aroun...
Manuchehr Soleimani, Phaneendra K. Yalavarthy, Ham...
ATAL
2004
Springer
15 years 11 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
ICN
2005
Springer
15 years 11 months ago
AIMD Penalty Shaper to Enforce Assured Service for TCP Flows
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
Emmanuel Lochin, Pascal Anelli, Serge Fdida
168
Voted
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 10 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
IPL
2010
112views more  IPL 2010»
15 years 4 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...