Sciweavers

2034 search results - page 289 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
NSDI
2007
13 years 10 months ago
An Experimentation Workbench for Replayable Networking Research
The network and distributed systems research communities have an increasing need for “replayable” research, but our current experimentation resources fall short of reaching th...
Eric Eide, Leigh Stoller, Jay Lepreau
JCC
2007
79views more  JCC 2007»
13 years 8 months ago
Interfacing Q-Chem and CHARMM to perform QM/MM reaction path calculations
Abstract: A hybrid quantum mechanical/molecular mechanical (QM/MM) potential energy function with HartreeFock, density functional theory (DFT), and post-HF (RIMP2, MP2, CCSD) capab...
H. Lee Woodcock III, Milan Hodoscek, Andrew T. B. ...
AROBOTS
2011
13 years 3 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
ASPLOS
2004
ACM
14 years 1 months ago
FAB: building distributed enterprise disk arrays from commodity components
This paper describes the design, implementation, and evaluation of a Federated Array of Bricks (FAB), a distributed disk array that provides the reliability of traditional enterpr...
Yasushi Saito, Svend Frølund, Alistair C. V...
ICDM
2007
IEEE
186views Data Mining» more  ICDM 2007»
14 years 2 months ago
Mining Interpretable Human Strategies: A Case Study
This paper focuses on mining human strategies by observing their actions. Our application domain is an HCI study aimed at discovering general strategies used by software users and...
Xiaoli Z. Fern, Chaitanya Komireddy, Margaret M. B...