Sciweavers

1144 search results - page 88 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
JCM
2007
79views more  JCM 2007»
14 years 9 months ago
Time Slot Assignment for Maximum Bandwidth in a Mobile Ad Hoc Network
—Time slot assignment is essential to provide the calculated bandwidth in a TDMA (Time Division Multiple Access)-based mobile ad hoc network (MANET), which is a focus of attentio...
Jianping Li, Yasushi Wakahara
VISUALIZATION
2002
IEEE
15 years 2 months ago
Maximum Entropy Light Source Placement
Finding the “best” viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the notion of “best...
Stefan Gumhold
FOCS
2008
IEEE
14 years 10 months ago
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
Maurice Cheung, Chaitanya Swamy
IJCSA
2007
110views more  IJCSA 2007»
14 years 9 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
BMCBI
2007
190views more  BMCBI 2007»
14 years 10 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey