Sciweavers

614 search results - page 33 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
CATS
2007
14 years 11 months ago
Effective Prediction and its Computational Complexity
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
Richard Taylor
MOBIHOC
2006
ACM
15 years 9 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
COMPGEOM
2004
ACM
15 years 3 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
GECCO
2004
Springer
15 years 3 months ago
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
Andreas Alexander Albrecht
HYBRID
2007
Springer
15 years 4 months ago
A Partial Order Approach to Discrete Dynamic Feedback in a Class of Hybrid Systems
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
Domitilla Del Vecchio