Sciweavers

3049 search results - page 363 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 22 hour 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
189
Voted
TIT
2010
146views Education» more  TIT 2010»
15 years 1 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
FPGA
2006
ACM
113views FPGA» more  FPGA 2006»
15 years 10 months ago
Optimality study of logic synthesis for LUT-based FPGAs
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
Jason Cong, Kirill Minkovich
ECCV
1996
Springer
16 years 8 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler
CEC
2009
IEEE
16 years 1 months ago
Differential Evolution with Laplace mutation operator
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
Millie Pant, Radha Thangaraj, Ajith Abraham, Crina...