Sciweavers

189 search results - page 29 / 38
» Revisiting SIMD Programming
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 4 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
IFIP
2004
Springer
15 years 2 months ago
Effective Chemistry for Synchrony and Asynchrony
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
Deepak Garg, Akash Lal, Sanjiva Prasad
SPIN
2004
Springer
15 years 2 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
ESAW
2006
Springer
15 years 1 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
85
Voted
ESAW
2006
Springer
15 years 1 months ago
A Definition of Exceptions in Agent-Oriented Computing
The research on exception handling in Multi-Agent Systems has produced some advanced models to deal with `exceptional situations'. The expression `agent exception' is how...
Eric Platon, Nicolas Sabouret, Shinichi Honiden