Sciweavers

1325 search results - page 118 / 265
» The Incidence Propagation Method
Sort
View
WETICE
1999
IEEE
14 years 1 months ago
Active Hypertext for Distributed Web Applications
The prevailing architecture for web-based applications relies on HTML, HTTP and loosely integrated functional elements, propagating a strong distinction between client and server....
Eckhart Köppen, Gustaf Neumann
PLILP
1994
Springer
14 years 1 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz
AAAI
2010
13 years 10 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
EMNLP
2008
13 years 10 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
HEURISTICS
2006
148views more  HEURISTICS 2006»
13 years 9 months ago
On global warming: Flow-based soft global constraints
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...