Sciweavers

5592 search results - page 326 / 1119
» On Random Betweenness Constraints
Sort
View
ATAL
2010
Springer
15 years 7 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
AI
2008
Springer
15 years 6 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
AIR
1999
90views more  AIR 1999»
15 years 6 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf
ACL
2009
15 years 4 months ago
Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria
In this paper, we propose a novel method for semi-supervised learning of nonprojective log-linear dependency parsers using directly expressed linguistic prior knowledge (e.g. a no...
Gregory Druck, Gideon S. Mann, Andrew McCallum
ACL
2012
13 years 9 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers