2520 search results - page 321 / 504 » The complexity of approximating entropy |
196
click to vote
AMDO
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...
156
click to vote
AAAI
2007
15 years 8 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
170
click to vote
AIPS
2008
15 years 8 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
194
click to vote
WSC
2008
15 years 8 months ago
2008
Queueing theory is a well-known method for evaluating the performance of manufacturing systems. When we want to analyze the performance of a single machine, M/M/1 queues or approx...
179
click to vote
WSC
2008
15 years 8 months ago
2008
Many inference methods of queueing systems have been developed on the basis of Larson's QIE(queue inference engine) with the assumption of homogeneous Poisson arrivals. It in...