Sciweavers

1469 search results - page 72 / 294
» Approximate polynomial decomposition
Sort
View
CIA
2006
Springer
15 years 1 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
PUK
2003
14 years 11 months ago
On the Decomposition and Concurrent Resolution of a Planning Problem
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
Laura Sebastia, Eva Onaindia, Eliseo Marzal
CPC
2006
93views more  CPC 2006»
14 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
ICASSP
2011
IEEE
14 years 1 months ago
Generalizations of Blom And Bloem's PDF decomposition for permutation-invariant estimation
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
David Frederic Crouse, Peter Willett, Yaakov Bar-S...
STACS
2009
Springer
15 years 4 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey