Sciweavers

1710 search results - page 301 / 342
» High-Level Programs and Program Conditions
Sort
View
MP
2006
88views more  MP 2006»
13 years 9 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
SIAMJO
2008
72views more  SIAMJO 2008»
13 years 9 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
TCOM
2008
110views more  TCOM 2008»
13 years 9 months ago
Cross-layer Adaptive Transmission: Optimal Strategies in Fading Channels
We consider cross-layer adaptive transmission for a single-user system with stochastic data traffic and a timevarying wireless channel. The objective is to vary the transmit power ...
Anh Tuan Hoang, Mehul Motani
AUTOMATICA
2005
93views more  AUTOMATICA 2005»
13 years 9 months ago
Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
Jorge Júlvez, Laura Recalde, Manuel Silva
JAIR
2007
111views more  JAIR 2007»
13 years 9 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson