10666 search results - page 1380 / 2134 » Quantum programming languages |
305
click to vote
CP
2009
Springer
16 years 8 months ago
2009
Springer
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
180
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
204
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
197
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
191
click to vote
CC
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally conside...