4894 search results - page 76 / 979 » Choices |
152
click to vote
ADCM
2007
15 years 6 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
134
click to vote
IEEESP
2008
15 years 6 months ago
2008
Abstract. Multiple choice questionnaires (mcqs) are a widely-used assessment procedure where examinees are asked to select one or more choices from a list. This invited talk1 explo...
162
click to vote
JSAT
2008
15 years 6 months ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
138
click to vote
LATA
2010
Springer
16 years 26 days ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
139
click to vote
DATE
2009
IEEE
16 years 24 days ago
2009
IEEE
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...