نتایج جستجو برای: analysis of algorithms

تعداد نتایج: 21340170  

2002
James D. Fix Richard Ladner Richard Anderson Jean-Loup Baer

Cache Performance Analysis of Algorithms

2005
Michael Miller

We explore a simple game-theoretical betting model where players’ bets influence the outcome of a probabilistic game. We find that the dynamics and equilibrium results for these games are quite simple, but the transitory distribution of wealth is interesting. Most econophysics models of wealth distribution use random exchanges. In our model, in contrast, skill accounts for a majority of the wea...

2015
Balázs Szörényi Róbert Busa-Fekete Adil Paul Eyke Hüllermeier

We study the problem of online rank elicitation, assuming that rankings of a set of alternatives obey the Plackett-Luce distribution. Following the setting of the dueling bandits problem, the learner is allowed to query pairwise comparisons between alternatives, i.e., to sample pairwise marginals of the distribution in an online fashion. Using this information, the learner seeks to reliably pre...

2002

Analyzing the costs of any production task can be complex. In this case, the many scenarios that must be considered make the analysis even more difficult. To analyze different work splits, we have developed a cost model that can be used to examine the effects of the cost drivers under different scenarios. We have also identified and examined a number of other issues beyond those in the congress...

2004
Pascal T. Wolkotte Gerard J.M. Smit Lodewijk T. Smit

In this article we present the results of partitioning the OFDM baseband processing of a DRM receiver into smaller independent processes. Furthermore, we give a short introduction into the relevant parts of the DRM standard. Based on the number of multiplications and additions we can map individual processes on a heterogeneous multitile architecture. This architecture can meet both the computat...

Journal: :Int. J. Systems Science 2009
Yu-Hung Chien Shey-Huei Sheu Chin-Chih Chang

We consider an age-replacement model with minimal repair based on a cumulative repair cost limit and random lead time for replacement delivery. A cumulative repair cost limit policy uses information about a system's entire repair cost history to decide whether the system is repaired or replaced; a random lead time models delay in delivery of a replacement once it is ordered. A general cost mode...

2003
Donald J. Reifer Barry W. Boehm Murali Gangadharan

This paper describes enhancements being made to the University of Southern California’s COnstructive COTS (COCOTS) integration cost model to address security concerns. The paper starts by summarizing the actions we have taken to enhance COCOMO II to model the impact of security on development effort and duration. It then relates the COCOMO II approach to the COCOTS estimating framework so that ...

2011
Michael K. Tanenhaus

Successful communication would seem to require that speakers and listeners distinguish between their own knowledge, commitments and intentions, and those of their interlocutors. A particularly important distinction is between shared knowledge (common ground) and private knowledge (privileged ground). Keeping track of what is shared and what is privileged might seem too computationally expensive...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید