2095 search results - page 136 / 419 » Improved pebbling bounds |
137
click to vote
IANDC
2010
15 years 5 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
183
click to vote
TCS
2011
15 years 1 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
180
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
190
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
114
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...