2899 search results - page 165 / 580 » Dynamic Trees in Practice |
155
Voted
SC
2009
ACM
15 years 11 months ago
2009
ACM
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
191
click to vote
CPM
1998
Springer
15 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
139
click to vote
ECSCW
2011
14 years 4 months ago
2011
Cooperation and collaboration are generally an inherent part of everyday practice, and particularly among nurses. However, the technologies that support these practices are still i...
109
click to vote
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
227
Voted
EVOW
2009
Springer
15 years 2 months ago
2009
Springer
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...