218 search results - page 26 / 44 » Finite Trees as Ordinals |
114
click to vote
JFPLC
2004
14 years 11 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
ENTCS
2010
14 years 10 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
ENTCS
2002
14 years 9 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...