Sciweavers

2487 search results - page 371 / 498
» cases 2009
Sort
View
COR
2010
150views more  COR 2010»
15 years 24 days ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 23 days ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi
73
Voted
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 23 days ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
119
Voted
NETWORKS
2007
15 years 5 days ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
APGV
2009
ACM
268views Visualization» more  APGV 2009»
15 years 4 months ago
Saliency maps of high dynamic range images
A number of computational models of visual attention have been proposed based on the concept of saliency map, most of them validated using oculometric data. They are widely used fo...
Josselin Petit, Roland Brémond, Jean-Philip...