Sciweavers

334 search results - page 28 / 67
» Dynamic Three-Dimensional Linear Programming
Sort
View
CCE
2008
14 years 9 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
AI
1999
Springer
14 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 3 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
CP
2005
Springer
15 years 3 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
78
Voted
CDC
2009
IEEE
121views Control Systems» more  CDC 2009»
15 years 2 months ago
Piecewise-linear constrained control for timed continuous Petri nets
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
Carlos Renato Vázquez, Manuel Silva