14699 search results - page 317 / 2940 » Complexity and Cognitive Computing |
148
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
117
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
127
click to vote
ENTCS
2008
15 years 4 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
116
click to vote
JCSS
1998
15 years 4 months ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
141
click to vote
TCS
2010
15 years 2 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...