Sciweavers

1662 search results - page 248 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
CHI
2004
ACM
14 years 9 months ago
Persistence matters: making the most of chat in tightly-coupled work
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
Darren Gergle, David R. Millen, Robert E. Kraut, S...
ITICSE
2009
ACM
14 years 3 months ago
Software reuse and plagiarism: a code of practice
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signiï¬...
J. Paul Gibson
IPPS
2007
IEEE
14 years 3 months ago
Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
Azzedine Boukerche, Jan Mendonca Correa, Alba Cris...
IPPS
2006
IEEE
14 years 2 months ago
A framework to develop symbolic performance models of parallel applications
Performance and workload modeling has numerous uses at every stage of the high-end computing lifecycle: design, integration, procurement, installation and tuning. Despite the trem...
Sadaf R. Alam, Jeffrey S. Vetter
EUROPAR
2004
Springer
14 years 15 days ago
Imprecise Exceptions in Distributed Parallel Components
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
Kostadin Damevski, Steven G. Parker