Sciweavers

4451 search results - page 148 / 891
» On Random Ordering Constraints
Sort
View
128
Voted
AAAI
2010
15 years 6 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
119
Voted
CP
2005
Springer
15 years 10 months ago
Encoding Requests to Web Service Compositions as Constraints
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
Alexander Lazovik, Marco Aiello, Rosella Gennari
ISPD
2007
ACM
86views Hardware» more  ISPD 2007»
15 years 6 months ago
Dummy fill density analysis with coupling constraints
In modern VLSI manufacturing processes, dummy fills are widely used to adjust local metal density in order to improve layout unifor
Hua Xiang, Liang Deng, Ruchir Puri, Kai-Yuan Chao,...
ACL
2001
15 years 6 months ago
Topological Dependency Trees: A Constraint-Based Account of Linear Precedence
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
Denys Duchier, Ralph Debusmann
ACL
1994
15 years 6 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow