Sciweavers

945 search results - page 86 / 189
» Incremental Branching Programs
Sort
View
ISSTA
2010
ACM
13 years 11 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 2 months ago
Predicate Expression Cost Functions to Guide Evolutionary Search for Test Data
Several researchers are using evolutionary search methods to search for test data with which to test a program. The fitness or cost function depends on the test goal but almost in...
Leonardo Bottaci
CAV
2006
Springer
129views Hardware» more  CAV 2006»
14 years 24 days ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
IFIP12
2008
13 years 10 months ago
Applying Data Mining to the Study of Joseki
Go is a strategic two player boardgame of Chinese origin. In terms of game theory, it is a deterministic perfect information game. But despite of these factors it is terribly comp...
Michiel Helvensteijn
JDA
2010
122views more  JDA 2010»
13 years 3 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos