Sciweavers

4622 search results - page 193 / 925
» Foundations of Information Theory
Sort
View
MAAMAW
1994
Springer
15 years 10 months ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner
ICFEM
2007
Springer
15 years 10 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel
ISN
2000
Springer
151views Communications» more  ISN 2000»
15 years 10 months ago
Agent-Based Management
In logistics of today's economy we have to deal with distributed systems. To support the demanding management task the multi-agent approach offers promising perspectives. For ...
Andreas Kind
FSTTCS
1991
Springer
15 years 10 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
VL
1991
IEEE
183views Visual Languages» more  VL 1991»
15 years 10 months ago
The Conceptual Programming Environment, CP: Reasoning Representation using Graph Structures and Operations
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for u...
Heather Pfeiffer, Roger T. Hartley