Sciweavers

654 search results - page 53 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 4 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
IJIT
2004
14 years 11 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 4 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
TPDS
2008
136views more  TPDS 2008»
14 years 9 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...