Sciweavers

5022 search results - page 105 / 1005
» Data structures and problem solving using Java
Sort
View
SIGCSE
1998
ACM
131views Education» more  SIGCSE 1998»
15 years 2 months ago
Animation, visualization, and interaction in CS 1 assignments
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
Owen L. Astrachan, Susan H. Rodger
ICMLA
2009
14 years 7 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
ASPDAC
1999
ACM
113views Hardware» more  ASPDAC 1999»
15 years 2 months ago
An Efficient Iterative Improvement Technique for VLSI Circuit Partitioning Using Hybrid Bucket Structures
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...
C. K. Eem, J. W. Chong
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 3 months ago
Rapid and Robust Compiler Construction Using Template-Based Metacompilation
We have developed Tm, a template-based metacompiler. Given a set of data-structure definitions and a template, Tm generates files that instantiate the template for the given data...
Kees van Reeuwijk
EUROPAR
2000
Springer
15 years 1 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...