341 search results - page 33 / 69 » Learning to satisfy |
MOBIHOC
2012
ACM
11 years 10 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
ALT
2001
Springer
14 years 4 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
IBPRIA
2009
Springer
14 years 5 days ago
2009
Springer
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
ECML
1993
Springer
13 years 11 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...