Results 261 to 270 of about 1,830,098 (281)
Some of the next articles are maybe not open access.
2001
The Self-Directed Search (SDS) is a self-administered, self-scored, and self-interpreted vocational interest assessment tool. The design of the SDS enables it to be used with or without guidance from a counselor to help an individual examine vocational or educational environments which may be complementary to his or her interests and personality. Since
Colby Sandoval Srsic +2 more
openaire +1 more source
The Self-Directed Search (SDS) is a self-administered, self-scored, and self-interpreted vocational interest assessment tool. The design of the SDS enables it to be used with or without guidance from a counselor to help an individual examine vocational or educational environments which may be complementary to his or her interests and personality. Since
Colby Sandoval Srsic +2 more
openaire +1 more source
Hit-Directed Nearest-Neighbor Searching
Journal of Medicinal Chemistry, 2004This work describes a practical strategy used at Pharmacia for identifying compounds for follow-up screening following an initial HTS campaign against targets where no 3-D structural information is available and preliminary SAR models do not exist. The approach explicitly takes into account different representations of chemistry space and identifies ...
Veerabahu, Shanmugasundaram +2 more
openaire +2 more sources
1984
Problem solving can be viewed as the process of generating solutions from observed or given data. Unfortunately, It is not always possible to use direct methods (i.e. go from data to solution directly), instead, we often have to use indirect or model-based methods.
Alan Bundy, Lincoln Wallen
openaire +1 more source
Problem solving can be viewed as the process of generating solutions from observed or given data. Unfortunately, It is not always possible to use direct methods (i.e. go from data to solution directly), instead, we often have to use indirect or model-based methods.
Alan Bundy, Lincoln Wallen
openaire +1 more source
A Search Direction Extensible Fast Search Algorithm
2006 First International Symposium on Pervasive Computing and Applications, 2006This paper proposes a novel fast search algorithm with search direction extensible, through investigating diamond search algorithm's directivity and robustness. The proposed algorithm starts with a five-point diamond search's block matching, and decides the direction from the center check point to the least block distortion point to be the search ...
Meibin Qi +3 more
openaire +1 more source
Supersymmetric dark matter — direct searches
Nuclear Physics B - Proceedings Supplements, 2000Abstract The sensitivities of the experiments of direct search for WIMPs have remarkably improved in recent years, allowing now the exploration of sizeable regions of the physical parameter space of specific particle candidates for dark matter. This is the case of the neutralino for which some direct detection experiments are already capable of ...
openaire +2 more sources
1987
In this chapter we shall describe a number of direct search methods for minimization. Such methods do not require the explicit evaluation of any partial derivatives of the function being minimized, but instead rely solely on values of the function found during the iterative process.
openaire +1 more source
In this chapter we shall describe a number of direct search methods for minimization. Such methods do not require the explicit evaluation of any partial derivatives of the function being minimized, but instead rely solely on values of the function found during the iterative process.
openaire +1 more source
2017
Chapter 3 proposed the coordinate search (CS) algorithm for unconstrained optimization. The algorithm worked based on local exploration around the incumbent solution in the positive and negative orthogonal coordinate directions. In Chapter 7, this algorithm was expanded to allow a broader use of search directions, resulting in the generalised pattern ...
Charles Audet, Warren Hare
openaire +2 more sources
Chapter 3 proposed the coordinate search (CS) algorithm for unconstrained optimization. The algorithm worked based on local exploration around the incumbent solution in the positive and negative orthogonal coordinate directions. In Chapter 7, this algorithm was expanded to allow a broader use of search directions, resulting in the generalised pattern ...
Charles Audet, Warren Hare
openaire +2 more sources