Sciweavers

1603 search results - page 173 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 6 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
OL
2010
128views more  OL 2010»
15 years 5 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
SCHEDULING
2008
72views more  SCHEDULING 2008»
15 years 6 months ago
The impact of local policies on the quality of packet routing in paths, trees, and rings
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
Eric Angel, Evripidis Bampis, Fanny Pascual
BMCBI
2004
141views more  BMCBI 2004»
15 years 6 months ago
Estimates of statistical significance for comparison of individual positions in multiple sequence alignments
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
Ruslan Sadreyev, Nick V. Grishin
INFOCOM
2007
IEEE
16 years 25 days ago
Lexicographic Fairness in WDM Optical Cross-Connects
— We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or m...
Satya Ranjan Mohanty, Laxmi N. Bhuyan