2905 search results - page 156 / 581 » Formal Memetic Algorithms |
SAS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
ICFCA
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using informat...
ALDT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
SYNASC
2008
IEEE
14 years 4 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
Automated synthesis of monitors from high-level properties plays a significant role in assertion-based verification. We present here a methodology to synthesize assertion monitors...