Sciweavers

995 search results - page 79 / 199
» complexity 2011
Sort
View
AUTOMATICA
2011
15 years 1 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
CORR
2011
Springer
339views Education» more  CORR 2011»
15 years 1 months ago
Context Capture in Software Development
The context of a software developer is something hard to define and capture, as it represents a complex network of elements across different dimensions that are not limited to th...
Bruno Antunes, Francisco Correia, Paulo Gomes
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
CORR
2011
Springer
161views Education» more  CORR 2011»
15 years 1 months ago
The physical Church-Turing thesis and the principles of quantum theory
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
Pablo Arrighi, Gilles Dowek
CORR
2011
Springer
207views Education» more  CORR 2011»
15 years 1 months ago
DB Category: Denotational Semantics for View-based Database Mappings
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
Zoran Majkic