1263 search results - page 115 / 253 » A* with Bounded Costs |
152
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
161
click to vote
JACM
2008
15 years 6 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
150
click to vote
TALG
2008
15 years 6 months ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
152
click to vote
JSAC
2010
15 years 4 months ago
2010
In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as ...
174
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...