Sciweavers

234 search results - page 11 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
PUK
2001
14 years 11 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
IPPS
2003
IEEE
15 years 3 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
CP
2003
Springer
15 years 3 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
ADG
2006
Springer
220views Mathematics» more  ADG 2006»
15 years 3 months ago
Cylinders Through Five Points: Complex and Real Enumerative Geometry
It is known that five points in 3 generically determine a finite number of cylinders containing those points. We discuss ways in which it can be shown that the generic (complex) nu...
Daniel Lichtblau
SEMCO
2007
IEEE
15 years 4 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth