555 search results - page 69 / 111 » Decompositions of Grammar Constraints |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
EMSOFT
2008
Springer
13 years 10 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
ALGORITHMICA
2007
13 years 8 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
INFORMS
2000
13 years 8 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
DCG
1998
13 years 8 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...