Sciweavers

1763 search results - page 176 / 353
» A Formalization of Polytime Functions
Sort
View
TNN
2008
106views more  TNN 2008»
15 years 4 months ago
Unsupervised Segmentation With Dynamical Units
In this paper, we present a novel network to separate mixtures of inputs that have been previously learned. A significant capability of the network is that it segments the componen...
A. Ravishankar Rao, Guillermo A. Cecchi, Charles C...
COMCOM
2000
130views more  COMCOM 2000»
15 years 4 months ago
Use Case Maps and LOTOS for the prototyping and validation of a mobile group call system
ABSTRACT -- SPEC-VALUE, a rigorous scenario-driven approach for the description and validation of complex system functionalities at the early stages of design, is presented. It is ...
Daniel Amyot, Luigi Logrippo
NGC
1998
Springer
171views Communications» more  NGC 1998»
15 years 3 months ago
Programming Languages for Distributed Applications
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
Seif Haridi, Peter Van Roy, Per Brand, Christian S...
JELIA
2010
Springer
15 years 2 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
GI
2010
Springer
15 years 2 months ago
Finite System Composition and Interaction
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
Johannes Reich