14165 search results - page 223 / 2833 » The generalized two-server problem |
155
click to vote
DSN
2006
IEEE
16 years 17 days ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
162
click to vote
CP
2005
Springer
16 years 1 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
170
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
145
click to vote
SAS
2005
Springer
16 years 6 hour ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
175
click to vote
WADS
2005
Springer
16 years 1 hour ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...