Sciweavers

635 search results - page 19 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
IPPS
2003
IEEE
15 years 2 months ago
Importance of SIMD Computation Reconsidered
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...
Will C. Meilander, Johnnie W. Baker, Mingxian Jin
MCU
2007
113views Hardware» more  MCU 2007»
14 years 11 months ago
On the Computational Capabilities of Several Models
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
Olivier Bournez, Emmanuel Hainry
ECCV
1994
Springer
15 years 11 months ago
Non-parametric Local Transforms for Computing Visual Correspondence
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
Ramin Zabih, John Woodfill
SIGCSE
1998
ACM
84views Education» more  SIGCSE 1998»
15 years 1 months ago
Integrating technology into computer science examinations
On-line programming tests and examinations were administered to approximately 120 first year computer science students in order to evaluate their practical skills. We describe ou...
David V. Mason, Denise M. Woit
COR
2010
127views more  COR 2010»
14 years 9 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...