Sciweavers

3433 search results - page 212 / 687
» Heuristics for a bidding problem
Sort
View
CP
2009
Springer
16 years 1 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
15 years 10 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
BROADNETS
2006
IEEE
15 years 10 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
ATMOS
2009
105views Optimization» more  ATMOS 2009»
15 years 7 months ago
On Assessing Robustness in Transportation Planning
Abstract. We consider a fundamental problem, called QoS-aware Multicommodity Flow, for assessing robustness in transportation planning. It constitutes a natural generalization of t...
Apostolos Bessas, Christos D. Zaroliagis
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 11 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla