4438 search results - page 417 / 888 » The Case for Collaborative Programming |
183
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
172
click to vote
CHI
1998
ACM
15 years 11 months ago
1998
ACM
considered simply, but a more complex evaluation of the effects of performing the tasks. For example, an educational activity that learners complete quickly and accurately is of no...
206
click to vote
AAAI
2006
15 years 8 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
174
click to vote
JUCS
2010
15 years 5 months ago
2010
: Lisp programmers constantly carry out experiments in a read-eval-print loop. The experimental activities convince the Lisp programmers that new or modified pieces of programs wo...
176
click to vote
RV
2010
Springer
15 years 5 months ago
2010
Springer
Researchers have developed a number of runtime verification tools that generate runtime monitors in the form of AspectJ aspects. In this work, we present Clara, a novel framework ...