1662 search results - page 248 / 333 » The Computational Complexity of Agent Design Problems |
157
click to vote
CHI
2004
ACM
16 years 6 months ago
2004
ACM
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...
145
click to vote
ITICSE
2009
ACM
16 years 21 days ago
2009
ACM
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ï¬...
183
click to vote
IPPS
2007
IEEE
16 years 15 days ago
2007
IEEE
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...
163
click to vote
IPPS
2006
IEEE
16 years 6 days ago
2006
IEEE
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...
164
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
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...