14165 search results - page 675 / 2833 » The generalized two-server problem |
196
Voted
IPPS
2005
IEEE
16 years 26 days ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
250
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
208
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
217
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
194
click to vote
JAL
2006
15 years 7 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...