In the script there is a definition for the competitiveness of an algorithm. However, this definition only holds if we want to evaluate an algorithm by means of its costs. Sometimes, we want to compare algorithms regarding their benefit rather than their costs. In this case, we have to be a bit careful with the definition of a c-competitive algorithm. We say that an algorithm Alg is c-competiti...

Innovation activities are a critical factor in national and regional development. The innovative behaviour of companies is one of the main sources of competitiveness, business survival, economic growth and employment in a territory. It is therefore important to identify and understand the factors that determine innovation behaviour among enterprises. In line with...

This report presents a theoretical model of the rate at which complex formation approaches equilibrium in competitive binding systems while ligand concentration varies. Three commonly encountered systems are examined in which binder concentrations (q) are fixed at 0.5/K, 3/K and 50/K, respectively. Our analysis of the incubation time for any particular fraction of reaction completeness shows th...

We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memor...

We present a new strategy for searching for a goal in a street. The strategy works in two phases. First it follows an angular bisector, then it uses circular arcs based only on one side of the street. A competitive factor of 1.514 is achieved which is remarkably close to the lower bound of √ 2. Secondly, we assume that the location of the goal is known to the robot. We prove a lower bound of √ ...

We consider online competitive algorithms for the problem of collecting weighted items froma dynamic set S, when items are added to or deleted from S over time. The objective isto maximize the total weight of collected items. We study the general version, as well asvariants with various restrictions, including the following: the uniform case, when all itemshave the same weight, ...

This paper gives a randomized competitive distributed paging algorithm called Heat & Dump. The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio BFR].

The separation of generalization error into two types, bias and variance (Geman, Bienenstock, Doursat, 1992), leads to the notion of error reduction by averaging over a "committee" of classifiers (Perrone, 1993). Committee perfonnance decreases with both the average error of the constituent classifiers and increases with the degree to which the misclassifications are correlated across the commi...

pressure refers to the feelings an athlete has about performing in a competitive situation. the primary aim of this study was to examine kinematic changes of tennis serves in increasing competitive pressure. 20 semi-professional right-handed male tennis players completed 120 serves under low (normal) and high competitive pressure phases. pressure checks (heart rate and perceived competitive sta...

abstract in order to evaluate of yield and yield components of eight wheat cultivars against flix weed (descurainia sophia), an experiment was conducted using a factorial arrangement of treatments in a randomized complete block design with four replications during 2003-2004 growing season in varamin region. the wheat cultivars were tabasi, roshan, karaj2, azadi, niknejad, mahdavi, shiraz and pi...