9842 search results - page 279 / 1969 » Problem complexity |
186
click to vote
AAAI
1998
15 years 8 months ago
1998
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
190
click to vote
SODA
2000
ACM
15 years 8 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...
176
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
170
click to vote
ENTCS
2008
15 years 6 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...