1092 search results - page 147 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
159
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
170
click to vote
ADHOCNOW
2008
Springer
16 years 20 days ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
143
click to vote
DBPL
2007
Springer
16 years 14 days ago
2007
Springer
BPQL is a novel query language for querying business process specifications, introduced recently in [5, 6]. It is based on an intuitive business processes as rewriting systems, an...
159
click to vote
ECML
2007
Springer
16 years 14 days ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
178
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...