2095 search results - page 193 / 419 » Improved pebbling bounds |
198
click to vote
AI
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
135
click to vote
CSR
2007
Springer
16 years 22 days ago
2007
Springer
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
174
click to vote
HIPC
2007
Springer
16 years 21 days ago
2007
Springer
Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular...
170
click to vote
COCOON
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
163
click to vote
ISSAC
2005
Springer
16 years 1 days ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...