Sciweavers

3946 search results - page 688 / 790
» The computational complexity of choice sets
Sort
View
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 4 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
SOCO
2010
Springer
15 years 4 months ago
Automatic circle detection on digital images with an adaptive bacterial foraging algorithm
This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images without using the conventional Hough transform methods. The prop...
Sambarta Dasgupta, Swagatam Das, Arijit Biswas, Aj...
ASPDAC
2010
ACM
233views Hardware» more  ASPDAC 2010»
15 years 4 months ago
Computer-aided recoding for multi-core systems
- The design of embedded computing systems faces a serious productivity gap due to the increasing complexity of their hardware and software components. One solution to address this...
Rainer Dömer
ICASSP
2009
IEEE
15 years 4 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
15 years 1 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas