466 search results - page 36 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
100
click to vote
ESA
2010
Springer
15 years 27 days ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
101
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
103
click to vote
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
106
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...