Sciweavers

34974 search results - page 202 / 6995
» The particle computer system
Sort
View
DISCO
1993
114views Hardware» more  DISCO 1993»
15 years 11 months ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 7 months ago
Computations of probabilistic output admissible set for uncertain constrained systems
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
Takeshi Hatanaka, Kiyotsugu Takaba
PROMAS
2005
Springer
16 years 20 days ago
Agent-Based Computing and Programming of Agent Systems
The concepts of autonomous agent and multi-agent system appropriate levels of abstraction for the design, implementation and simulation of many complex, distributed computational s...
Michael Luck, Peter McBurney, Jorge Gonzalez-Palac...
AUTOMATICA
2006
88views more  AUTOMATICA 2006»
15 years 7 months ago
Exact computation of amplification for a class of nonlinear systems arising from cellular signaling pathways
A commonly employed measure of the signal amplification properties of an input/output system is its induced L2 norm, sometimes also known as H gain. In general, however, it is ext...
Eduardo D. Sontag, Madalena Chaves
ICAC
2009
IEEE
16 years 1 months ago
Applying genetic algorithms to decision making in autonomic computing systems
Increasingly, applications need to be able to self-reconfigure in response to changing requirements and environmental conditions. Autonomic computing has been proposed as a means...
Andres J. Ramirez, David B. Knoester, Betty H. C. ...