9842 search results - page 186 / 1969 » Problem complexity |
135
click to vote
KBSE
1998
IEEE
15 years 6 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
93
Voted
IEAAIE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
110
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
87
Voted
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
118
Voted
COMPGEOM
1996
ACM
15 years 6 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...