2266 search results - page 350 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
133
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, a distributed power control algorithm is proposed for wireless relay networks in interference-limited environments. The objective is to minimize the total transm...
144
click to vote
TIME
2009
IEEE
15 years 10 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
114
click to vote
IJCAI
2003
15 years 5 months ago
2003
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
137
click to vote
NIPS
2003
15 years 5 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
120
click to vote
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...