Sciweavers

5022 search results - page 449 / 1005
» Data structures and problem solving using Java
Sort
View
EOR
2006
66views more  EOR 2006»
15 years 4 months ago
Multi-period capacity expansion for a local access telecommunications network
In this paper, we examine a multi-period capacity expansion problem for a local access telecommunications network with a tree topology. Capacity expansion is realized through the ...
Michel Gendreau, Jean-Yves Potvin, Ali Smires, Pat...
DAM
1998
77views more  DAM 1998»
15 years 4 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes
ICML
2009
IEEE
16 years 5 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
ICTAI
1999
IEEE
15 years 8 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
CCCG
2004
15 years 6 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...