Sciweavers

1469 search results - page 215 / 294
» Approximate polynomial decomposition
Sort
View
CATS
2006
15 years 7 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
FLAIRS
2006
15 years 7 months ago
Sensitivity Analysis of Markovian Models
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
Theodore Charitos, Linda C. van der Gaag
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
15 years 6 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
IJCSA
2006
121views more  IJCSA 2006»
15 years 6 months ago
Evaluation of the RC4 Algorithm for Data Encryption
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...
Allam Mousa, Ahmad Hamad