Sciweavers

1391 search results - page 46 / 279
» Complexity Limitations on Quantum Computation
Sort
View
CNSR
2008
IEEE
136views Communications» more  CNSR 2008»
14 years 2 months ago
Using QR-Updating with Reduced Complexity for Precise Localization in Mobile Sensor Networks
Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node’s strict resource limitations regarding memory size, processor performance a...
Frank Reichenbach, Dominik Lieckfeldt, Dirk Timmer...
TSI
2008
89views more  TSI 2008»
13 years 7 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
PCI
2005
Springer
14 years 1 months ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...
JCC
2007
80views more  JCC 2007»
13 years 7 months ago
In between worlds: G.N. Lewis, the shared pair bond and its multifarious contexts
: In this paper, I will look at the rather convoluted discovery process which gave birth to the concept of the shared electron pair bond as developed by G.N. Lewis, to be subsequen...
Ana Simões
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson