Sciweavers

110 search results - page 3 / 22
» Searching with lies under error cost constraints
Sort
View
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 1 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ICASSP
2009
IEEE
14 years 2 months ago
Cross-lingual speech recognition under runtime resource constraints
This paper proposes and compares four cross-lingual and bilingual automatic speech recognition techniques under the constraints of limited memory size and CPU speed. The first thr...
Dong Yu, Li Deng, Peng Liu, Jian Wu, Yifan Gong, A...
NETWORKS
2007
13 years 6 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
TSP
2008
100views more  TSP 2008»
13 years 7 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III