1176 search results - page 152 / 236 » Implicit Abstraction Heuristics |
TACAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
95
Voted
VMCAI
2004
Springer
15 years 6 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
107
Voted
WAIM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Ensemble methods can achieve excellent performance relying on member classifiers’ accuracy and diversity. We conduct an empirical study of the relationship of ensemble...
111
Voted
CEC
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
122
click to vote
AE
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...