Sciweavers

1176 search results - page 71 / 236
» Implicit Abstraction Heuristics
Sort
View
SUM
2007
Springer
14 years 4 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
HPCC
2005
Springer
14 years 3 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...
ICCS
2005
Springer
14 years 3 months ago
Resource Partitioning Algorithms in a Programmable Service Grid Architecture
Abstract. We propose the use of programmable Grid resource partitioning heuristics in the context of a distributed service Grid management architecture. The architecture is capable...
Pieter Thysebaert, Bruno Volckaert, Marc De Leenhe...
SEMWEB
2005
Springer
14 years 3 months ago
Constructing Complex Semantic Mappings Between XML Data and Ontologies
Abstract. Much data is published on the Web in XML format satisfying schemas, and to make the Semantic Web a reality, such data needs to be interpreted with respect to ontologies. ...
Yuan An, Alexander Borgida, John Mylopoulos
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 3 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang