1984 search results - page 245 / 397 » The colourful feasibility problem |
148
click to vote
ISSTA
1996
ACM
15 years 10 months ago
1996
ACM
In assessing the quality of software, we would like to make engineering judgements similar to those based on statistical quality control. Ideally, we want to support statements li...
155
click to vote
APL
1993
ACM
15 years 10 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
164
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
While it has been realized for quite some time within AI that abduction is a general model of explanation for a variety of tasks, there have been no empirical investigations into ...
195
click to vote
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Traditional debug methodologies are limited in their ability to provide debugging support for many-core parallel programming. Synchronization problems or bugs due to race conditio...
156
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...