Sciweavers

5236 search results - page 843 / 1048
» Similarity Measurement in Context
Sort
View
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 10 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
COMPGEOM
1995
ACM
15 years 10 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
ECOOP
1995
Springer
15 years 10 months ago
Do Object-Oriented Languages Need Special Hardware Support?
Previous studies have shown that object-oriented programs have different execution characteristics than procedural programs, and that special object-oriented hardware can improve p...
Urs Hölzle, David Ungar
FPGA
1995
ACM
110views FPGA» more  FPGA 1995»
15 years 10 months ago
Testing of Uncustomized Segmented Channel Field Programmable Gate Arrays
This paper presents a methodology for production-time testing of (uncustomized) segmented channel eld programmable gate arrays (FPGAs) such as those manufactured by Actel [1]. Th...
Tong Liu, Wei-Kang Huang, Fabrizio Lombardi
ICML
1994
IEEE
15 years 10 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak