2842 search results - page 172 / 569 » Expansion and Search in Networks |
152
click to vote
ROBOCOMM
2007
IEEE
16 years 24 days ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
195
click to vote
WINE
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
175
click to vote
UAI
2003
15 years 7 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
179
click to vote
JSAC
2006
15 years 6 months ago
2006
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
162
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...