Sciweavers

2976 search results - page 485 / 596
» On the bounded integer programming
Sort
View
IFIP
2007
Springer
16 years 16 days ago
Elliptic Control by Penalty Techniques with Control Reduction
The paper deals with the numerical treatment of optimal control problems with bounded distributed controls and elliptic state equations by a wider class of barrier-penalty methods...
Christian Grossmann, Holger Kunz, Robert Meischner
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
16 years 15 days ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
ACSD
2006
IEEE
80views Hardware» more  ACSD 2006»
16 years 14 days ago
Schedulability Analysis of Petri Nets Based on Structural Properties
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
ECRTS
2006
IEEE
16 years 13 days ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
16 years 14 hour ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu