149 search results - page 29 / 30 » A Length-Invariant Hybrid Mix |
ISSAC
2009
Springer
14 years 25 days ago
2009
Springer
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
CP
2007
Springer
14 years 13 days ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
CSCW
2004
ACM
13 years 11 months ago
2004
ACM
In this paper, we introduce the concept of dynamically changing between centralized, replicated, and hybrid collaboration architectures. It is implemented by providing users a fun...
CP
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
MOC
2011
13 years 1 months ago
2011
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...