Sciweavers

26354 search results - page 271 / 5271
» How we refactor, and how we know it
Sort
View
CSL
2007
Springer
16 years 27 days ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
CIG
2006
IEEE
16 years 23 days ago
Fun in Slots
— People play games for fun. Yet we are lacking a fundamental understanding of what fun is and how fun works in games and other media. For example, why do thousands of people spe...
Kevin Burns
166
Voted
ICALT
2006
IEEE
16 years 23 days ago
Plagiarism in e-Learning Systems: Identifying and Solving the Problem for Practical Assignments
A big part of life long learning is the move from residential lectures to distance education. Distance education falls under the multi-modal policy of the teaching institution and...
Emil Marais, Ursula Minnaar, David Argles
VL
2006
IEEE
100views Visual Languages» more  VL 2006»
16 years 22 days ago
Mica: A Web-Search Tool for Finding API Components and Examples
Because software libraries are numerous and large, learning how to use them is a common and problematic task for experienced programmers and novices alike. Internet search engines...
Jeffrey Stylos, Brad A. Myers
ACMSE
2006
ACM
16 years 21 days ago
Using genetic algorithms to generate test plans for functionality testing
Like in other fields, computer products (applications, hardware, etc.), before being marketed, require some level of testing to verify whether they meet their design and function...
Francisca Emanuelle Vieira, Francisco Martins, Raf...