Sciweavers

2905 search results - page 566 / 581
» Formal Memetic Algorithms
Sort
View
LICS
1994
IEEE
13 years 11 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
DEBS
2007
ACM
13 years 11 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
DOCENG
2007
ACM
13 years 11 months ago
A document engineering environment for clinical guidelines
In this paper, we present a document engineering environment for Clinical Guidelines (G-DEE), which are standardized medical documents developed to improve the quality of medical ...
Gersende Georg, Marie-Christine Jaulent
RTA
2010
Springer
13 years 11 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
ATAL
2006
Springer
13 years 11 months ago
Convergence analysis for collective vocabulary development
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...
Jun Wang, Les Gasser, Jim Houk