2905 search results - page 167 / 581 » Formal Memetic Algorithms |
CAV
2001
Springer
14 years 2 months ago
2001
Springer
In formal verification, we verify that a system is correct with respect to a specification. When verification succeeds and the system is proven to be correct, there is still a q...
CHARME
1997
Springer
14 years 1 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
SIROCCO
2004
13 years 11 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
JAIR
2008
13 years 10 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
COCO
2005
Springer
14 years 3 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...