Sciweavers

299 search results - page 9 / 60
» Dispositional implementation solves the superfluous structur...
Sort
View
74
Voted
ITICSE
2009
ACM
15 years 6 months ago
Hybrid and custom data structures: evolution of the data structures course
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
Daniel J. Ernst, Daniel E. Stevenson, Paul J. Wagn...
96
Voted
CDES
2008
123views Hardware» more  CDES 2008»
15 years 1 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
JSW
2006
76views more  JSW 2006»
14 years 11 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
ECOOP
1999
Springer
15 years 4 months ago
Visualizing Reference Patterns for Solving Memory Leaks in Java
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
Wim De Pauw, Gary Sevitsky
106
Voted
ECML
1991
Springer
15 years 3 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell