Sciweavers

736 search results - page 100 / 148
» Confidence-Aware Join Algorithms
Sort
View
ECAI
2004
Springer
14 years 3 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
LCN
2005
IEEE
14 years 3 months ago
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
John Risson, Ken Robinson, Tim Moors
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 3 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
ICCS
2003
Springer
14 years 3 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 10 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn