Sciweavers

4934 search results - page 226 / 987
» complexity 2008
Sort
View
IJFCS
2008
49views more  IJFCS 2008»
15 years 5 months ago
A Markovian Approach for the Analysis of the gene Structure
Hidden Markov models (HMMs) are effective tools to detect series of statistically homogeneous structures, but they are not well suited to analyse complex structures. Numerous meth...
Christelle Melo de Lima, Laurent Gueguen, Christia...
CSE
2008
IEEE
15 years 7 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 7 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....
TSP
2008
113views more  TSP 2008»
15 years 5 months ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
CISS
2008
IEEE
15 years 12 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie