5624 search results - page 963 / 1125 » On Conditional Covering Problem |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
123
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
108
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...