Sciweavers

2403 search results - page 180 / 481
» Optimal Randomized RANSAC
Sort
View
ISPA
2005
Springer
16 years 13 days ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
16 years 1 months ago
LQG control over lossy TCP-like networks with probabilistic packet acknowledgements
Abstract— This paper is concerned with control applications over lossy data networks. Sensor data is transmitted to an estimation-control unit over a network, and control command...
Emanuele Garone, Bruno Sinopoli, Alessandro Casavo...
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 7 months ago
Utility Constrained Energy Minimization In Aloha Networks
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...
Amir Mahdi Khodaian, Babak Hossein Khalaj, Mohamma...
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
15 years 11 months ago
TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing stateful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, t...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi
FSTTCS
1995
Springer
15 years 10 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain