2957 search results - page 208 / 592 » The Complexity of Polynomial-Time Approximation |
188
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
236
click to vote
ATAL
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
186
click to vote
AAAI
2007
15 years 9 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
188
click to vote
AAAI
1990
15 years 7 months ago
1990
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
166
click to vote
MOC
2010
15 years 1 months ago
2010
We consider temporal approximation of stationary statistical properties of dissipative complex dynamical systems. We demonstrate that stationary statistical properties of the time...