14518 search results - page 215 / 2904 » Two Problems for Sophistication |
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
114
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
102
click to vote
AIPS
2008
15 years 3 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
121
Voted
CEC
2011
IEEE
14 years 21 days ago
2011
IEEE
—Over the last two decades, many Differential Evolution (DE) strategies have been introduced for solving Optimization Problems. Due to the variability of the characteristics in o...
112
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...