2168 search results - page 194 / 434 » Randomized Algorithms and Complexity Theory |
113
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
139
Voted
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
133
Voted
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
130
Voted
TCS
2010
14 years 10 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
118
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...