2905 search results - page 313 / 581 » Formal Memetic Algorithms |
149
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
The paper deals with on-board planning for a satellite swarm via communication and negotiation. We aim at defining individual behaviours that result in a global behaviour that me...
169
click to vote
ATVA
2007
Springer
16 years 25 days ago
2007
Springer
Message Sequence Charts (MSCs) and High-level Message Sequence Charts (HMSCs) are formalisms used to describe scenarios of message passing protocols. We propose using Allen’s log...
163
click to vote
CAV
2007
Springer
16 years 25 days ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
193
click to vote
CAV
2007
Springer
16 years 25 days ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
172
click to vote
EVOW
2007
Springer
16 years 25 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...