235 search results - page 34 / 47 » A New Approach of Eliminating Redundant Association Rules |
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
—Many large-scale distributed systems can benefit from a service that allows them to select among alternative nodes based on their relative network positions. A variety of appro...
SCHOLARPEDIA
2008
14 years 11 months ago
2008
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
120
click to vote
ICC
2011
IEEE
13 years 11 months ago
2011
IEEE
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
CP
2007
Springer
15 years 5 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...