Results 1  10
of
12,820
BFS Algorithm
"... Abstract: Sampoorna ragas are the backbone of the Indian classical music. The sampoorna ragas in south Indian classical music can be divided into vivadi and avivadi ragas. The vivadi ragas are the one which produce discordant effect and hinder the free flow. The proposed identifying the vivadi and ..."
Abstract
 Add to MetaCart
and avivadi ragas through BSF can help in retrieving all the janya ragas and implementing the same in automated accompanying system. Keywords: Vivadi ragas, Sampoorna ragas, Avivadi ragas, BFS algorithm.
A computational study of externalmemory BFS algorithms
 In SODA
, 2006
"... Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of the large number of I/Os it incurs. This paper presents the first experimental evaluation of recent exte ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
externalmemory BFS algorithms for general graphs. With our STXXL based implementations exploiting pipelining and diskparallelism, we were able to compute the BFS level decomposition of a webcrawl based graph of around 130 million nodes and 1.4 billion edges in less than 4 hours using single disk and 2
A Computational Study of ExternalMemory BFS Algorithms*
"... 1 Introduction Solving real world optimization problems often boilsdown to traversing graphs in a structured way. Breadth First Search (BFS) is among the most fundamental suchtraversal strategies. It decomposes the input graph G = (V, E) of n nodes and m edges into at most n levelswhere level ..."
Abstract
 Add to MetaCart
1 Introduction Solving real world optimization problems often boilsdown to traversing graphs in a structured way. Breadth First Search (BFS) is among the most fundamental suchtraversal strategies. It decomposes the input graph G = (V, E) of n nodes and m edges into at most n levelswhere level
2.2 Centralized BFS Algorithm........................ 4
, 2009
"... In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based mo ..."
Abstract
 Add to MetaCart
In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based modelcheckers like SPIN. We consider variants for both depthfirst as well as breadthfirst based generation of the reduced state graphs onthefly.
Abstract A Computational Study of ExternalMemory BFS Algorithms ∗
"... Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of the large number of I/Os it incurs. This paper presents the first experimental evaluation of recent exte ..."
Abstract
 Add to MetaCart
externalmemory BFS algorithms for general graphs. With our STXXL based implementations exploiting pipelining and diskparallelism, we were able to compute the BFS level decomposition of a webcrawl based graph of around 130 million nodes and 1.4 billion edges in less than 4 hours using single disk and 2
GMMmodel for Dynamic Multicast Groups using a probabilistic BFS Algorithm
"... Generalized Multiobjective Multitree model (GMMmodel) considering by the first time multitreemulticast load balancing with splitting in a multiobjective context. To solve the GMMmodel, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was ..."
Abstract
 Add to MetaCart
. In this case, several path between every node in the multicast transmission paths given by the GMMmodel and the new egress node is found using a probabilistic Breadth First Search (BFS) algorithm which the computational time is polynomial. Experimental results considering up to 11 different objectives
A lexBFS Algorithm for Proper Interval Graph Recognition
, 1993
"... Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no interval contains another, we obtain the subclass of proper interval graphs. In this paper, we show how to recognize proper interval graphs with one lexBFS. This algorithm ..."
Abstract
 Add to MetaCart
Interval graphs are the intersection graphs of families of intervals in the real line. If the intervals can be chosen so that no interval contains another, we obtain the subclass of proper interval graphs. In this paper, we show how to recognize proper interval graphs with one lexBFS
A New Solution for NQueens Problem using Blind Approaches: DFS and BFS Algorithms
"... The N×N queen’s puzzle is the problem of placing N chess queen on an N×N chess board so that no two queens attack each other. This approach is a classical problem in the artificial intelligence area. A solution requires that no two queens share the same row, column or diagonal. These problems for co ..."
Abstract
 Add to MetaCart
for computer scientists present practical solution to many useful applications and have become an important issue. In this paper we proposed new resolution for solving nQueens used combination of depth firs search (DFS) and breathe first search (BFS) techniques. The proposed algorithm act based on placing
Optimizing Multiples Objectives in Dynamic Multicast Groups using a probabilistic BFS Algorithm
"... Generalized Multiobjective Multitree model (GMMmodel) considering multitreemulticast load balancing with splitting in a multiobjective context. To solve the GMMmodel, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was proposed. In this ..."
Abstract
 Add to MetaCart
Generalized Multiobjective Multitree model (GMMmodel) considering multitreemulticast load balancing with splitting in a multiobjective context. To solve the GMMmodel, a multiobjective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) was proposed
Wrappers for Feature Subset Selection
 AIJ SPECIAL ISSUE ON RELEVANCE
, 1997
"... In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set, a ..."
Abstract

Cited by 1522 (3 self)
 Add to MetaCart
In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set
Results 1  10
of
12,820