Sciweavers

173 search results - page 23 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
CORR
2010
Springer
254views Education» more  CORR 2010»
13 years 6 months ago
Information-Theoretic Analysis of an Energy Harvesting Communication System
—In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consu...
Omur Ozel, Sennur Ulukus
BIBE
2003
IEEE
14 years 26 days ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
PPSN
2004
Springer
14 years 28 days ago
A Visual Demonstration of Convergence Properties of Cooperative Coevolution
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
Liviu Panait, R. Paul Wiegand, Sean Luke
UAI
2003
13 years 9 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
DAM
2007
74views more  DAM 2007»
13 years 7 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...