Sciweavers

15375 search results - page 186 / 3075
» cans 2008
Sort
View
CN
2006
88views more  CN 2006»
13 years 8 months ago
Benefits of advertising wavelength availability in distributed lightpath establishment
In this paper, we study the benefits of advertising wavelength availability in a distributed lightpath establishment environment by extensive simulations. Various cases with diffe...
Shu Shen, Gaoxi Xiao, Tee Hiang Cheng
COMPUTING
2006
110views more  COMPUTING 2006»
13 years 8 months ago
An Alternative Algorithm for a Sliding Window ULV Decomposition
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...
H. Erbay, J. Barlow
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 8 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
COR
2006
86views more  COR 2006»
13 years 8 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
CPC
2006
92views more  CPC 2006»
13 years 8 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...