Sciweavers

2060 search results - page 374 / 412
» The Composition of Event-B Models
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 8 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
COORDINATION
2000
Springer
15 years 8 months ago
OpenSpaces: An Object-Oriented Framework for Reconfigurable Coordination Spaces
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
Stéphane Ducasse, Thomas Hofmann, Oscar Nie...
FMCAD
2000
Springer
15 years 7 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
15 years 7 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
ALT
2009
Springer
15 years 7 months ago
Learning and Domain Adaptation
Domain adaptation is a fundamental learning problem where one wishes to use labeled data from one or several source domains to learn a hypothesis performing well on a different, y...
Yishay Mansour