Scholars Central

Search Scholars Central

Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.

Advanced searchHide advanced search

In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:

Years

26–50 of 356 articles for Algorithmic Probability

Then save them, add them to a collection or cite them together.
  1. Conference abstract · 24 Oct 2016

    The impact of functional redundancy on molecular signatures

    highly accurate and relevant for the biomedical condition, they probably reflect functional redundancy. As most algorithms were developed with the goal of finding the smallest highly relevant subset of variables

  2. Research article · Aug 2015

    Development of an Adaptive Hybrid Algorithm for Congestion Control and Bandwidth Utilization in a Mobile Network

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 3, Issue 8

    congestion in mobile network. The developed hybrid algorithm is implemented using NetBeans IDE 6.9.1 platform to obtain performance metrics of blocking probability of new calls and dropping probability of handover

  3. Research article · Feb 2015

    Power Allocation for Two Source Destination Pair Cooperative Communication System under The Outage Probability Constraint

    International Journal of Innovative Research in Science, Engineering and Technology · Volume 4, Issue 2

    Filling (SPWF) algorithm can minimize the total power, based on the outage probability constraint. In the conventional algorithms, the solution is obtained by an iterative binary searching and Lagrange Multiplier…

  4. Research article · 24 Aug 2021

    Simulation Model Based on the BCG Matrix and Markov Chains

    Journal of Management Information and Decision Sciences · Volume 24, Issue SI-mis-for-todays-business

    model. The designed algorithm of the model classified the product according to the BCG matrix and, through simulations, allowed calculating the probabilities of transition from one classification to another…

  5. Research article · Jan 2014

    Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 2, Issue 1

    Computing most probable delay of a given graph having node(n) and edges (m) is NP-Hard problem. The hardness of the problem doesn‟t impact on the restricted version ... ordered pairs which is a part of implementing…

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels