Sciweavers

14699 search results - page 460 / 2940
» Complexity and Cognitive Computing
Sort
View
IAT
2005
IEEE
16 years 14 days ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 7 days ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
PCM
2004
Springer
168views Multimedia» more  PCM 2004»
16 years 6 days ago
Approximating Inference on Complex Motion Models Using Multi-model Particle Filter
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
Jianyu Wang, Debin Zhao, Shiguang Shan, Wen Gao
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
16 years 2 days ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
COMPGEOM
2008
ACM
15 years 8 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...