Sciweavers

3367 search results - page 533 / 674
» Incremental assignment problem
Sort
View
JSAC
2006
157views more  JSAC 2006»
15 years 3 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
INFORMS
1998
150views more  INFORMS 1998»
15 years 2 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
JAIR
2010
77views more  JAIR 2010»
15 years 1 months ago
Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...
E. H. Durfee Wu, Edmund H. Durfee
GLOBECOM
2010
IEEE
15 years 1 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...
ATAL
2011
Springer
14 years 3 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....