Sciweavers

299 search results - page 11 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
MOBIHOC
2009
ACM
16 years 8 days ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
96
Voted
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
15 years 6 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
ARC
2007
Springer
123views Hardware» more  ARC 2007»
15 years 3 months ago
Multiple Sequence Alignment Using Reconfigurable Computing
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
Carlos R. Erig Lima, Heitor S. Lopes, Maiko R. Mor...
EUROPAR
2010
Springer
14 years 12 months ago
Analysis of Multi-Organization Scheduling Algorithms
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
Johanne Cohen, Daniel Cordeiro, Denis Trystram, Fr...
TMC
2008
127views more  TMC 2008»
14 years 11 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik