2126 search results - page 363 / 426 » An optimization algorithm for imprecise multi-objective prob... |
113
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
151
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
148
click to vote
ASIAN
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
114
Voted
ALMOB
2006
15 years 2 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
133
Voted
SCN
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...