1705 search results - page 93 / 341 » Representing Constraints with Automata |
CP
2009
Springer
14 years 11 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
ICFP
2008
ACM
14 years 10 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
GIS
1999
ACM
14 years 2 months ago
1999
ACM
An important activity in the design of a particular database application consists in identifying the integrity constraints that must hold on the database, and that are used to det...
AAAI
2008
14 years 17 days ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
EMNLP
2008
13 years 11 months ago
2008
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...