Sciweavers

2403 search results - page 250 / 481
» Optimal Randomized RANSAC
Sort
View
TIT
2008
95views more  TIT 2008»
15 years 3 months ago
On the Delay and Throughput Gains of Coding in Unreliable Networks
In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, wher...
Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel M&eacu...
JDA
2007
135views more  JDA 2007»
15 years 3 months ago
Cache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
Bin Tang, Himanshu Gupta
TEC
2002
163views more  TEC 2002»
15 years 3 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
TPDS
2002
136views more  TPDS 2002»
15 years 3 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
PE
2010
Springer
116views Optimization» more  PE 2010»
15 years 2 months ago
A polling model with multiple priority levels
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma