Sciweavers

881 search results - page 121 / 177
» Solving satisfiability problems with preferences
Sort
View
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 1 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
ECAI
2004
Springer
14 years 1 months ago
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Alan M. Frisch, Christopher Jefferson, Ian Miguel
INFOCOM
2002
IEEE
14 years 18 days ago
Joint Scheduling and Power Control for Wireless Ad-hoc Networks
—In this paper, we introduce a cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks. The motivation for this study is twofold,...
Tamer A. ElBatt, Anthony Ephremides
KBSE
2002
IEEE
14 years 17 days ago
Generating Test Data for Functions with Pointer Inputs
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
Srinivas Visvanathan, Neelam Gupta
IPPS
2000
IEEE
14 years 1 days ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal