1802 search results - page 124 / 361 » Complexity Theory for Operators in Analysis |
158
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
207
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
152
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
189
click to vote
ICFCA
2004
Springer
15 years 11 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
164
click to vote
AAAI
2006
15 years 7 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...