Hive-a petabyte scale data warehouse using hadoop
The size of data sets being collected and analyzed in the industry for business intelligence is
growing rapidly, making traditional warehousing solutions prohibitively expensive. Hadoop …
growing rapidly, making traditional warehousing solutions prohibitively expensive. Hadoop …
[图书][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[图书][B] Constraint processing
R Dechter - 2003 - books.google.com
This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …
Classifying the complexity of constraints using finite algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …
This class of problems is known to be NP-complete in general, but certain restrictions on the …
Closure properties of constraints
Many combinatorial search problems can be expressed as “constraint satisfaction problems”
and this class of problems is known to be NP-complete in general. In this paper, we …
and this class of problems is known to be NP-complete in general. In this paper, we …
On the algebraic structure of combinatorial problems
P Jeavons - Theoretical Computer Science, 1998 - Elsevier
We describe a general algebraic formulation for a wide range of combinatorial problems
including Satisfiability, Graph Colorability and Graph Isomorphism In this formulation each …
including Satisfiability, Graph Colorability and Graph Isomorphism In this formulation each …
[图书][B] Function algebras on finite sets: Basic course on many-valued logic and clone theory
D Lau - 2006 - books.google.com
Functions which are defined on finite sets occur in almost all fields of mathematics. For more
than 80 years algebras whose universes are such functions (so-called function algebras) …
than 80 years algebras whose universes are such functions (so-called function algebras) …
Dualities for constraint satisfaction problems
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one
homomorphism to the non-existence of other homomorphisms. In this survey paper, we give …
homomorphism to the non-existence of other homomorphisms. In this survey paper, we give …
Constraints, consistency and closure
Although the constraint satisfaction problem is NP-complete in general, a number of
constraint classes have been identified for which some fixed level of local consistency is …
constraint classes have been identified for which some fixed level of local consistency is …
Automatic differentiation in PCF
We study the correctness of automatic differentiation (AD) in the context of a higher-order,
Turing-complete language (PCF with real numbers), both in forward and reverse mode. Our …
Turing-complete language (PCF with real numbers), both in forward and reverse mode. Our …