2194 search results - page 85 / 439 » Improving HLRTA*( k ) |
157
Voted
SWAT
2010
Springer
15 years 6 days ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
146
click to vote
CORR
2010
Springer
15 years 4 days ago
2010
Springer
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing ...
120
click to vote
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
174
click to vote
CONSTRAINTS
2011
14 years 8 months ago
2011
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [8] in that it ...
126
click to vote
DAM
2011
14 years 8 months ago
2011
We prove that if G = (VG, EG) is a finite, simple, and undirected graph with κ components and independence number α(G), then there exist a positive integer k ∈ N and a functi...