14386 search results - page 253 / 2878 » The Chinese Generals Problem |
144
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
139
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
119
click to vote
BPM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
123
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
130
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...