Sciweavers

169 search results - page 14 / 34
» A Mathematical Programming Model For A Timetabling Problem
Sort
View
JUCS
2006
93views more  JUCS 2006»
14 years 9 months ago
Synthesis of Optimal Workflow Structure
: Optimal synthesis of workflow structures, the formerly undefined problem, has been introduced. Mathematical programming model is presented for determining the cost optimal workfl...
József Tick, Zoltán Kovacs, Ferenc F...
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
CORR
2010
Springer
88views Education» more  CORR 2010»
14 years 9 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 4 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
NHM
2010
87views more  NHM 2010»
14 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...