Sciweavers

2834 search results - page 58 / 567
» Representing Trees with Constraints
Sort
View
ACL
2006
13 years 10 months ago
Soft Syntactic Constraints for Word Alignment through Discriminative Training
Word alignment methods can gain valuable guidance by ensuring that their alignments maintain cohesion with respect to the phrases specified by a monolingual dependency tree. Howev...
Colin Cherry, Dekang Lin
JOIN
2007
91views more  JOIN 2007»
13 years 8 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
CP
2008
Springer
13 years 10 months ago
Perfect Constraints Are Tractable
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
András Z. Salamon, Peter G. Jeavons
CP
2009
Springer
14 years 9 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
CP
2006
Springer
14 years 19 days ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan