3221 search results - page 504 / 645 » Termination of Linear Programs |
188
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
160
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
157
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Mutants are automatically-generated, possibly faulty variants of programs. The mutation adequacy ratio of a test suite is the ratio of non-equivalent mutants it is able to identif...
154
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
266
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...