Sciweavers

1396 search results - page 99 / 280
» Succinct Dynamic Data Structures
Sort
View
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
15 years 5 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
CEC
2010
IEEE
15 years 2 months ago
Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
Mustafa Misir, Katja Verbeeck, Patrick De Causmaec...
APIN
2000
87views more  APIN 2000»
15 years 1 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George
IV
2000
IEEE
221views Visualization» more  IV 2000»
15 years 5 months ago
Animated Texture Alpha-Masks for Flow Visualization
A method of using a moving texture alpha-mask to represent scientific data is described, for the purpose of visualizing continuous fluid dynamics fields. The method combines strea...
Ian Curington
FCT
1995
Springer
15 years 5 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...