Sciweavers

29908 search results - page 237 / 5982
» On the Complexity of
Sort
View
APL
1998
ACM
15 years 11 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
PODS
1998
ACM
116views Database» more  PODS 1998»
15 years 11 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
IBERAMIA
1998
Springer
15 years 11 months ago
Bayesian Networks for Reliability Analysis of Complex Systems
This paper presents an extension of Bayesian networks (BN) applied to reliability analysis. We developed a general methodology for modelling reliability of complex systems based o...
José G. Torres-Toledano, Luis Enrique Sucar
IMR
1998
Springer
15 years 11 months ago
Boundary Layer Meshing for Viscous Flows in Complex Domains
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
Rao V. Garimella, Mark S. Shephard
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 10 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran