Sciweavers

1522 search results - page 66 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
IPL
2006
79views more  IPL 2006»
13 years 7 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
DSMML
2004
Springer
14 years 1 months ago
Multi Channel Sequence Processing
Abstract. This paper summarizes some of the current research challenges arising from multi-channel sequence processing. Indeed, multiple real life applications involve simultaneous...
Samy Bengio, Hervé Bourlard
ECCC
2010
86views more  ECCC 2010»
13 years 7 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
IROS
2009
IEEE
144views Robotics» more  IROS 2009»
14 years 2 months ago
Behavior-based motion planning for group control
— Despite the large body of work in both motion planning and multi-agent simulation, little work has focused on the problem of planning motion for groups of robots using external...
Christopher Vo, Joseph F. Harrison, Jyh-Ming Lien
ISICA
2007
Springer
14 years 1 months ago
On the Performance of Metamodel Assisted MOEA/D
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...