Sciweavers

632 search results - page 120 / 127
» Combining programming with theorem proving
Sort
View
CHI
1995
ACM
13 years 11 months ago
Integrating multiple cues for spoken language understanding
As spoken language interfaces for real-world systems become a practical possibility, it has become apparent that such interfaces will need to draw on a variety of cues from divers...
Karen Ward, David G. Novick
DAC
2005
ACM
13 years 9 months ago
VLIW: a case study of parallelism verification
Parallelism in processor architecture and design imposes a verification challenge as the exponential growth in the number of execution combinations becomes unwieldy. In this paper...
Allon Adir, Yaron Arbetman, Bella Dubrov, Yossi Li...
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 7 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
DISOPT
2007
155views more  DISOPT 2007»
13 years 7 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
ENTCS
2007
97views more  ENTCS 2007»
13 years 7 months ago
An Operational Semantics for Shared Messaging Communication
Shared Messaging Communication (SMC) has been introduced in [9] as a model of communication which reduces communication costs (both in terms of communication latency and memory us...
Astrid Kiehn