Sciweavers

32028 search results - page 262 / 6406
» Experimenting a
Sort
View
TEI
2010
ACM
130views Hardware» more  TEI 2010»
16 years 1 months ago
Experience definition through storyboarding
Sal Cilella, Craighton Berman, Justin Rheinfrank
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
16 years 1 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
16 years 1 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
AINA
2009
IEEE
16 years 1 months ago
TopDNS: Experiences Building Internet-Based Topologies with GNP
Building realistic Internet topologies is an important step towards predicting the behavior of new distributed applications and protocols. We are creating topologies that predict ...
Gert Pfeifer, Christof Fetzer
HICSS
2009
IEEE
94views Biometrics» more  HICSS 2009»
16 years 1 months ago
Enhancing Learning Experiences in Partially Distributed Teams: Training Students to Work Effectively Across Distances
Three training modules were designed to decrease ingroup dynamics in Partially Distributed Teams, which have two or more geographically separated subteams. The action research ori...
Rosalie J. Ocker, Dana Kracaw, Starr Roxanne Hiltz...