Sciweavers

2864 search results - page 332 / 573
» Constraint Programming in OPL
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
RSP
2006
IEEE
120views Control Systems» more  RSP 2006»
14 years 3 months ago
A Case Study of Design Space Exploration for Embedded Multimedia Applications on SoCs
Embedded real-time multimedia applications usually imply data parallel processing. SIMD processors embedded in SOCs are cost-effective to exploit the underlying parallelism. Howev...
Isabelle Hurbain, Corinne Ancourt, François...
PPDP
2005
Springer
14 years 2 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
CP
2001
Springer
14 years 1 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
SIGSOFT
2000
ACM
14 years 1 months ago
Compiler and tool support for debugging object protocols
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object "protocols," i.e., sequencing constra...
Sergey Butkevich, Marco Renedo, Gerald Baumgartner...