Sciweavers

72 search results - page 5 / 15
» Reducing the Derivation of Redundant Clauses in Reasoning Sy...
Sort
View
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 11 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
CCR
2002
98views more  CCR 2002»
13 years 8 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
JAIR
2010
111views more  JAIR 2010»
13 years 7 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
FLAIRS
2003
13 years 10 months ago
Hybrid Deletion Policies for Case Base Maintenance
Case memory maintenance in a Case-Based Reasoning system is important for two main reasons: (1) to control the case memory size; (2) to reduce irrelevant and redundant instances t...
Maria Salamó, Elisabet Golobardes
IEEEHPCS
2010
13 years 6 months ago
Using replication and checkpointing for reliable task management in computational Grids
In grid computing systems, providing fault-tolerance is required for both scientific computation and file-sharing to increase their reliability. In previous works, several mechani...
Sangho Yi, Derrick Kondo, Bongjae Kim, Geunyoung P...