Publicação

Efficient BSP/CGM algorithms for the maximum subsequence sum and related problems

Detalhes bibliográficos
Autores principais:	Martins, Wellington S
Assunto:	ALGORITMOS E ESTRUTURAS DE DADOS
Ano:	2015
País:	Brasil
Tipo de documento:	outro
Tipo de acesso:	acesso aberto
Instituição associada:	IBICT
Idioma:	inglês
Origem:	Oasisbr

Registos relacionados

BSP/CGM algorithms for maximum subsequence and maximum subarray
por: Song, Siang Wun
Publicado em: (2004)

Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA
por: Song, Siang Wun
Publicado em: (2016)

Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm
por: Song, Siang Wun
Publicado em: (2004)

Algoritmos BSP/CGM para Ordenação
por: Gonda, Luciano
Publicado em: (2011)

Algoritmos BSP/CGM para o Fecho Transitivo
por: Vieira, Cristiano Costa Argemon
Publicado em: (2011)

A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers
por: Song, Siang Wun
Publicado em: (2006)

Efficient parallel graph algorithms for coarse grained multicomputers and BSP
por: Song, Siang Wun
Publicado em: (1997)

Implementação e análise de algoritmos BSP/CGM em um Beowulf e no InteGrade
por: Nishibe, Christiane
Publicado em: (2011)

Algoritmos BSP/CGM para programação dinâmica
por: Loureiro, Leonardo Vinicius Rolan
Publicado em: (2011)

The maximum agreement forest problem: approximation algorithms and computational experiments
por: Wakabayashi, Yoshiko
Publicado em: (2007)

New BSP/CGM algorithms for spanning trees
por: Szwarcfiter, Jayme Luiz
Publicado em: (2019)

Algoritmo BSP/CGM para Computação de Circuitos de Euler em Grafos
por: Nasu, Claudia Yoshie
Publicado em: (2011)

Implementação e Avaliação de Algoritmos BSP/CGM para o Fecho Transitivo e Problemas Relacionados
por: Castro Junior, Amaury Antonio de
Publicado em: (2011)

Implementações alternativas FPT BSP/CGM para o problema k-Cobertura por Vértices
por: Aguena, Deiviston da Silva
Publicado em: (2011)

Algoritmo BSP/CGM para o Problema do Fluxo Máximo em redes
por: Xavier Junior, Roberto Aragy
Publicado em: (2011)

O Problema da k-Cobertura por Vértices: uma Implementação FPT no Modelo BSP/CGM
por: Hanashiro, Erik Joey
Publicado em: (2011)

Efficient selection algorithms on distributed memory computers
por: Song, Siang Wun
Publicado em: (1998)

Parallel dynamic programing for solving the string editing problem on a CGM/BSP
por: Song, Siang Wun
Publicado em: (2002)

Approximation algorithms for the max-buying problem with limited supply
por: Schouery, Rafael Crivellari Saliba
Publicado em: (2014)

A parallel wavefront algorithm for efficient biological sequence comparison
por: Song, Siang Wun
Publicado em: (2003)

Dynamic creation of BSP/CGM clusters on cloud computing platforms
por: Cordeiro, Daniel de Angelis
Publicado em: (2013)

An efficient bitwise algorithm for intra-procedural data-flow testing coverage
por: Araujo, Roberto Paulo Andrioli de
Publicado em: (2013)

Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
por: Wakabayashi, Yoshiko
Publicado em: (2000)

Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds
por: Song, Siang Wun
Publicado em: (2013)

New simple and efficient heuristics for the uncapacitated single allocation hub location problem
por: Cunha, Cláudio Barbieri da
Publicado em: (2009)

Efficient parallel graph algoritms for coarse-grained multicomputers and BSP
por: Roncato, A.
Publicado em: (2002)

Algorithmic aspects of regularity
por: Rodl, Vojtech
Publicado em: (2000)

A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
por: Song, Siang Wun
Publicado em: (2006)

Parallel transitive closure algorithm
por: Szwarcfiter, Jayme Luiz
Publicado em: (2013)

Algorithms for terminal Steiner trees
por: Soares, José Augusto Ramos
Publicado em: (2005)

Finding skew partitions efficiently
por: Reed, Bruce A
Publicado em: (2000)

A multi-GPU hitting set algorithm for GRNs inference
por: Borelli, Fabrizio F
Publicado em: (2015)

A range minima parallel algorithm for coarse grained multicomputers
por: Song, Siang Wun
Publicado em: (1999)

Social media platforms, algorithmic mediation and the emotional turn in communication
por: Romanini, Vinicius
Publicado em: (2022)

A coarse-grained parallel algorithm for spanning tree and connected components
por: Szwarcfiter, Jayme Luiz
Publicado em: (2004)

An all-substrings common subsequence algorithm
por: Song, Siang Wun
Publicado em: (2008)

An all-substrings common subsequence algorithm
por: Song, Siang Wun
Publicado em: (2005)

Data structures for direct spanning tree representations in mutation-based evolutionary algorithms
por: Bueno, Letícia Rodrigues
Publicado em: (2020)

A note on an L-approach for solving the manufacturer's pallet loading problem
por: Nishihara, Fábio Henrique
Publicado em: (2005)

Soluções para os problemas da soma máxima e do k-ésimo menor elemento de uma sequência usando o modelo BSP/CGM
por: Lima, Anderson Corrêa de
Publicado em: (2016)

Atividades financiadas

Não foram encontrados projetos financiados.