Sciweavers

2214 search results - page 419 / 443
» Complexity of Reasoning
Sort
View
FMICS
2006
Springer
15 years 3 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 3 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
ICSE
2000
IEEE-ACM
15 years 3 months ago
Workshop on multi-dimensional separation of concerns in software engineering
Separation of concerns has been central to software engineering for decades, yet its many advantages are still not fully realized. A key reason is that traditional modularization ...
Peri L. Tarr, William H. Harrison, Harold Ossher, ...
KBSE
1995
IEEE
15 years 3 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
SC
1995
ACM
15 years 3 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar