14649 search results - page 2832 / 2930 » Principles of problem solving |
150
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
148
click to vote
DGCI
2005
Springer
15 years 10 months ago
2005
Springer
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray...
134
click to vote
EMSOFT
2005
Springer
15 years 10 months ago
2005
Springer
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
142
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
137
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...