Sciweavers

223 search results - page 20 / 45
» Reaching with multi-referential dynamical systems
Sort
View
MFCS
1991
Springer
15 years 5 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
125
Voted
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
15 years 8 months ago
Dejong Function Optimization by Means of a Parallel Approach to Fuzzified Genetic Algorithm
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
Ebrahim Bagheri, Hossein Deldari
ICSE
2000
IEEE-ACM
15 years 5 months ago
A case study: demands on component-based development
Building software systems with reusable components brings many advantages. The development becomes more efficient, the reliability of the products is enhanced, and the maintenance...
Ivica Crnkovic, Magnus Larsson
MUE
2008
IEEE
103views Multimedia» more  MUE 2008»
15 years 8 months ago
Ubiquitous Web Access: Collaborative Optimization and Dynamic Content Negotiation
Traditionally, cellular wide area networks like UMTS are used as Internet access networks for particular users but, in some cases, they can be employed to provide Internet access ...
Xavier Sanchez-Loro, Victoria Beltran, Jordi Casad...
ICDCS
2003
IEEE
15 years 7 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande