Sciweavers

4860 search results - page 90 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
AAAI
2008
13 years 10 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
WSC
2007
13 years 10 months ago
A simulation-based algorithm for supply chain optimization
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
Takayuki Yoshizumi, Hiroyuki Okano
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
13 years 11 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
CAD
2000
Springer
13 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier