4378 search results - page 165 / 876 » On the Complexity of Ordered Colourings |
171
click to vote
IACR
2011
14 years 6 months ago
2011
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
184
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
191
click to vote
ECAL
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes a paradigm for specification of virtual human agents’level of autonomy. The idea we present in this paper aims at optimising the required complexity of agents...
161
click to vote
AIML
2008
15 years 8 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
133
click to vote
ACL
2003
15 years 8 months ago
2003
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...