1242 search results - page 120 / 249 » The Theory of Grammar Constraints |
159
click to vote
WSCG
2001
15 years 7 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
182
click to vote
FOCM
2010
15 years 4 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
201
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
130
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
158
click to vote
ESOP
2009
Springer
16 years 1 months ago
2009
Springer
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...