Sciweavers

716 search results - page 67 / 144
» Semilinear Program Feasibility
Sort
View
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
15 years 1 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
AAAI
2008
15 years 3 days ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
WSC
1997
14 years 11 months ago
Simulation of Modern Parallel Systems: A CSIM-based Approach
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
Dhabaleswar K. Panda, Debashis Basak, Donglai Dai,...
CCE
2006
14 years 9 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 7 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami