Sciweavers

1041 search results - page 140 / 209
» Randomizing Reductions of Search Problems
Sort
View
FMCAD
2000
Springer
13 years 11 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
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 1 months ago
Energy- and Performance-Driven NoC Communication Architecture Synthesis Using a Decomposition Approach
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
Ümit Y. Ogras, Radu Marculescu
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
13 years 11 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
ATAL
2010
Springer
13 years 9 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
CIA
2003
Springer
14 years 1 months ago
A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems
A multi-agent system is a network of software agents that cooperate to solve problems. In open multi-agent systems, the agents that need resources provided by other agents are not ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura