9842 search results - page 142 / 1969 » The Complexity of the Matching-Cut Problem |
124
click to vote
LATINCRYPT
2010
15 years 1 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
136
Voted
ESAW
2009
Springer
15 years 1 months ago
2009
Springer
009), which constitutes an abstraction of the various aspects of a MAS, generalizing the AGR approach and incorporating the institutional work of Searle (Searle 1995). This model i...
122
click to vote
JDA
2011
14 years 10 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
147
click to vote
IJRR
2006
15 years 3 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
137
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...