Sciweavers

724 search results - page 90 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
LICS
2008
IEEE
15 years 4 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe
ICCS
2005
Springer
15 years 3 months ago
Morphisms in Context
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
Markus Krötzsch, Pascal Hitzler, Guo-Qiang Zh...
ICCSA
2004
Springer
15 years 3 months ago
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
The use of ontologies lies at the very heart of the newly emerging era of Semantic Web. They provide a shared conceptualization of some domain that may be communicated between peop...
Mehul Bhatt, Carlo Wouters, Andrew Flahive, J. Wen...
HPCN
1995
Springer
15 years 1 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
FGCS
2000
145views more  FGCS 2000»
14 years 9 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz