Sciweavers

7228 search results - page 707 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICAS
2005
IEEE
90views Robotics» more  ICAS 2005»
16 years 1 months ago
A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of provid...
Cheng-Yuan Hoa, Yi-Cheng Chan, Yaw-Chung Chen
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 25 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
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
16 years 25 days ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
GECCO
2004
Springer
16 years 25 days ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
16 years 24 days ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
Qi Cheng, Ming-Deh A. Huang