149 search results - page 29 / 30 » A Length-Invariant Hybrid Mix |
91
Voted
ISSAC
2009
Springer
15 years 8 months 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...
89
Voted
CP
2007
Springer
15 years 8 months 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...
117
Voted
CSCW
2004
ACM
15 years 7 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...
93
Voted
CP
2003
Springer
15 years 7 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...
134
Voted
MOC
2011
14 years 8 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...