12194 search results - page 2106 / 2439 » Numberings Optimal for Learning |
192
click to vote
IWPC
2000
IEEE
15 years 11 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
168
click to vote
TOOLS
2000
IEEE
15 years 11 months ago
2000
IEEE
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of softwar...
195
click to vote
VISUALIZATION
2000
IEEE
15 years 11 months ago
2000
IEEE
Throughout the design cycle, visualization, whether a sketch scribbled on the back of a spare piece of paper or a fully detailed drawing, has been the mainstay of design: we need ...
187
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
165
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...