2095 search results - page 282 / 419 » Improved pebbling bounds |
195
click to vote
COR
2010
15 years 6 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
195
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
142
click to vote
ENTCS
2006
15 years 6 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
194
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Capacity gain from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static channels, when all nodes...