2218 search results - page 134 / 444 » Testing Expressibility Is Hard |
ISSRE
2010
IEEE
13 years 7 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
WISE
2009
Springer
14 years 4 months ago
2009
Springer
Planning out maintenance tasks to increase the quality of Web applications can be difficult for a manager. First, it is hard to evaluate the precise effect of a task on quality. S...
TAINN
2005
Springer
14 years 2 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ALENEX
2008
13 years 10 months ago
2008
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
EDM
2008
13 years 10 months ago
2008
In this paper we describe an educational data mining (EDM) case study based on the data collected during the online assessment of students who were able to immediately receive tail...