3946 search results - page 193 / 790 » The computational complexity of choice sets |
188
click to vote
WCC
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
180
click to vote
ICIP
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
183
Voted
SRDS
2010
IEEE
15 years 4 months ago
2010
IEEE
With the growing scale of current computing systems, traditional configuration tuning methods become less effective because they usually assume a small number of parameters in the...
152
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
Fast hardware turnover in supercomputing centers, stimulated by rapid technological progress, results in high heterogeneity among HPC platforms, and necessitates that applications...
181
click to vote
ICRA
2006
IEEE
16 years 20 days ago
2006
IEEE
— Quasistatic multi-legged locomotion consists of a sequence of equilibrium postures where the mechanism supports itself against gravity while moving free limbs to new positions....