6562 search results - page 113 / 1313 » Noetherianity and Combination Problems |
117
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
178
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
161
Voted
SETN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...
135
Voted
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
136
Voted
CP
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...