Sciweavers

9325 search results - page 344 / 1865
» The decentralized implementability problem
Sort
View
APLAS
2005
ACM
15 years 10 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...
ICPPW
2002
IEEE
15 years 9 months ago
Parallel Cholesky Factorization of a Block Tridiagonal Matrix
In this paper we discuss the parallel implementation of the Cholesky factorization of a positive definite symmetric matrix when that matrix is block tridiagonal. While parallel im...
Thuan D. Cao, John F. Hall, Robert A. van de Geijn
ENTCS
2007
70views more  ENTCS 2007»
15 years 4 months ago
Component Substitutability via Equivalencies of Component-Interaction Automata
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...
Ivana Cerná, Pavlína Vareková...
GPEM
2002
163views more  GPEM 2002»
15 years 4 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
ESAW
2009
Springer
15 years 11 months ago
Engineering Social Reality with Inheritance Relations
Abstract. In systems based on organisational specifications a reoccurring problem remains to be solved in the disparity between the level actness of the organisational concepts an...
Huib Aldewereld, Sergio Álvarez-Napagao, Fr...