Sciweavers

789 search results - page 6 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICMLA
2004
13 years 9 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
CLUSTER
2001
IEEE
13 years 11 months ago
A Distributed Object Model for Solving Irregularly Structured Problems on Cluster
This paper presents a distributed object model MOIDE for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is a...
Yudong Sun, Cho-Li Wang
FATES
2006
Springer
13 years 11 months ago
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems
To efficiently solve safety verification and testing problems for an aspect-oriented system, we use multitape automata to model aspects and propose algorithms for the aspect-orient...
Cheng Li, Zhe Dang
IJFCS
2007
80views more  IJFCS 2007»
13 years 7 months ago
Bisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...