Sciweavers

1529 search results - page 177 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ICDE
1991
IEEE
175views Database» more  ICDE 1991»
15 years 7 months ago
Constraint-Based Reasoning in Deductive Databases
— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
Jiawei Han
AIIA
2009
Springer
15 years 9 months ago
Optimal Planning with ACO
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
POPL
2010
ACM
15 years 11 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
PVLDB
2010
149views more  PVLDB 2010»
15 years 2 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
DSN
2007
IEEE
15 years 8 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski