466 search results - page 47 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
174
click to vote
IJON
2007
15 years 6 months ago
2007
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
143
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
148
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we suggest a new approach to analysis and design of IR systems. We argue for design space exploration in constructing IR systems and in analyzing the effects of ind...
182
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
156
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...