Sciweavers

555 search results - page 68 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
JPDC
2000
141views more  JPDC 2000»
13 years 7 months ago
A System for Evaluating Performance and Cost of SIMD Array Designs
: SIMD arrays are likely to become increasingly important as coprocessors in domain specific systems as architects continue to leverage RAM technology in their design. The problem ...
Martin C. Herbordt, Jade Cravy, Renoy Sam, Owais K...
EMISA
2010
Springer
13 years 5 months ago
Supporting ad hoc Analyses on Enterprise Models
Abstract: Enterprises are socio technical systems whose management involves multiple stakeholders each demanding for a distinct perspective on the enterprise. A large number of mod...
Sabine Buckl, Jens Gulden, Christian M. Schweda
CADE
2008
Springer
14 years 8 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ATAL
2009
Springer
14 years 2 months ago
A model for integrating dialogue and the execution of joint plans
Coming up with a plan for a team that operates in a non-deterministic environment is a complex process, and the problem is further complicated by the need for team members to comm...
Yuqing Tang, Timothy J. Norman, Simon Parsons
CPAIOR
2009
Springer
14 years 2 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...