386 search results - page 76 / 78 » Fundamental Questions |
ETS
2000
IEEE
13 years 9 months ago
2000
IEEE
Academic staff development in the pedagogical applications of new technologies is fundamental to the transformation of teaching and learning in tertiary education settings. We pre...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
JSYML
1998
13 years 9 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
TSE
1998
13 years 9 months ago
1998
— Modern networks provide a QoS (quality of service) model to go beyond best-effort services, but current QoS models are oriented towards low-level network parameters (e.g., band...
MST
2007
13 years 9 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...