Sciweavers

1431 search results - page 37 / 287
» The complexity of random ordered structures
Sort
View
ATAL
2008
Springer
14 years 11 months ago
Decentralised Structural Adaptation in Agent Organisations
Abstract. Autonomic computing is being advocated as a tool for maintaining and managing large, complex computing systems. Self-organising multi-agent systems provide a suitable par...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
JGAA
2007
135views more  JGAA 2007»
14 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
CIE
2010
Springer
14 years 10 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
FM
2009
Springer
101views Formal Methods» more  FM 2009»
15 years 2 months ago
Formal Reasoning about Expectation Properties for Continuous Random Variables
Abstract. Expectation (average) properties of continuous random variables are widely used to judge performance characteristics in engineering and physical sciences. This paper pres...
Osman Hasan, Naeem Abbasi, Behzad Akbarpour, Sofi&...
IANDC
2011
84views more  IANDC 2011»
14 years 4 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann