Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Laira Vieira Toscani"'
Publikováno v:
TEMA - Tendências em Matemática Aplicada e Computacional. 7
O presente trabalho aborda a complexidade computacional dos problemas de computar, com entradas intervalares, as medidas de tendencia central media, mediana e moda, e as medidas de dispersao amplitude total, variância, desvio padrao, coeficiente de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::423b2ac45a811691fea149d48bae0998
https://doi.org/10.5540/tema.2006.07.02.0297
https://doi.org/10.5540/tema.2006.07.02.0297
Autor:
Liara Aparecida dos Santos Leal, Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540290025
EUROCAST
EUROCAST
In this paper we continue along the same line of research started in earlier works, towards to providing a categorical view of structural complexity to optimization problems. The main aim is to provide a universal language for supporting formalisms t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::803cf82a84501764c73633a10bc66742
https://doi.org/10.1007/11556985_2
https://doi.org/10.1007/11556985_2
Autor:
Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes, Liara Aparecida dos Santos Leal
Publikováno v:
Computer Aided Systems Theory-EUROCAST 2003 ISBN: 9783540202219
EUROCAST
EUROCAST
Aiming at developing a theoretical framework for the formal study of NP-hard optimization problems, which is built on precise mathematical foundations, we have focused on structural properties of optimization problems related to approximative issue.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3341ac3f2bf92487076fcf0e94a677a
https://doi.org/10.1007/978-3-540-45210-2_7
https://doi.org/10.1007/978-3-540-45210-2_7
Publikováno v:
Foundations of Information Technology in the Era of Network and Mobile Computing ISBN: 9781475752755
IFIP TCS
IFIP TCS
Object-based programming languages are being widely used to construct concurrent and distributed systems. In such systems, the complexity of performing some task is usually measured in terms of messages that are exchanged to perform the task, because
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab41c8b9445d10fd9946b1ba98b15a13
https://doi.org/10.1007/978-0-387-35608-2_33
https://doi.org/10.1007/978-0-387-35608-2_33
Publikováno v:
Anais do XIII Simpósio de Arquitetura de Computadores e Processamento de Alto Desempenho (SBAC-PAD 2001).
lt is well-known that technology developments in Computing Science has led to new developments in Computing Theory and vice-versa. This work is a contribution towards the formalisation of Parallel Processing concepts. We exploit variations of the Tur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01f6db73cd43401b50cc04ae7ec363da
https://doi.org/10.5753/sbac-pad.2001.22201
https://doi.org/10.5753/sbac-pad.2001.22201
Autor:
Liara Aparecida dos Santos Leal, Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes
Publikováno v:
Computer Aided Systems Theory — EUROCAST 2001 ISBN: 9783540429593
EUROCAST
EUROCAST
This work presents a categorical approach to cope with some questions originally studied within Computational Complexity Theory. It proceeds a research with theoretical emphasis, aiming at characterising the structural properties of optimization prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27dbc5eec451192f68105474cfd68c22
https://doi.org/10.1007/3-540-45654-6_23
https://doi.org/10.1007/3-540-45654-6_23
Autor:
Manuel Jose Malasquez Negron, Laira Vieira Toscani, Aline Brum Loreto, Maria Paula Goncalves Fachin
Publikováno v:
Repositório Institucional da UFRGS
Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
A equação de complexidade de um algoritmo recursivo pode ser expressa em termos de uma equação de recorrência. A partir destas equações obtém-se uma expressão assintótica para a complexidade, provada por indução. Neste trabalho, propõe-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::294f524093fe6caf2fddeea633d83344
Publikováno v:
PAMM. 4:590-591
In the present work we are interested in to provide a universal language for supporting formalisms to specify the approximation hierarchy system for an abstract NP-hard optimization problem. This work grew from the idea of providing a categorical vie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::510f38dfd62a68a3adc969efd3e1cb25
https://doi.org/10.1002/pamm.200410276
https://doi.org/10.1002/pamm.200410276
Publikováno v:
Anais do II Simpósio Brasileiro de Arquitetura de Computadores e Processamento Paralelo (SBAC-PP 1988).
Este trabalho parte de uma formalização da programação dinâmica e examina arquiteturas paralelas com o objetivo de melhorar a eficiência do método. É apresentada uma análise de complexidade das versões seqüencial e paralela, juntamente com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d87454d247290b34b26d16972b9a9cef
https://doi.org/10.5753/sbac-pad.1988.23543
https://doi.org/10.5753/sbac-pad.1988.23543
Publikováno v:
Anais do I Simpósio Brasileiro de Arquitetura de Computadores e Processamento Paralelo (SBACC 1987).
Este trabalho analisa a complexidade de uma implementação do método de desenvolvimento de algoritmos Divisão e Conquista numa arquitetura paralela com estrutura de árvore, comparando-a à complexidade de uma implementação seqüencial.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34dd5c5daf962a2748da07604046bd61
https://doi.org/10.5753/sbac-pad.1987.23591
https://doi.org/10.5753/sbac-pad.1987.23591