Sciweavers

1957 search results - page 124 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
Junhua Zhu, Shan Chen, Brahim Bensaou, Ka-Lok Hung
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 4 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
TCBB
2010
166views more  TCBB 2010»
14 years 8 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
14 years 8 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed