1112 search results - page 120 / 223 » Executing Abstract Test Cases |
123
click to vote
DAM
2006
15 years 3 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
129
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Abstract. We present GUPU, a side-effect free environment specialized for programming courses. It seamlessly guides and supports students during all phases of program development, ...
123
click to vote
CAV
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...
121
click to vote
FORTE
2008
15 years 4 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
120
click to vote
AI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The purpose of this paper is to test the hypothesis that simple classifiers are more robust to changing environments than complex ones. We propose a strategy for generati...