Sciweavers

1453 search results - page 100 / 291
» Partial Constraint Satisfaction
Sort
View
NAACL
2003
15 years 5 months ago
Language choice models for microplanning and readability
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
Sandra Williams
AAAI
1994
15 years 5 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
EAAI
2008
104views more  EAAI 2008»
15 years 4 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
EDBT
2012
ACM
271views Database» more  EDBT 2012»
13 years 6 months ago
Towards a decentralised hierarchical architecture for smart grids
We present a hierarchical distributed communication and control architecture for Smart Grids. The proposed topology consists of multiple layers to allow for robust and flexible d...
Daniel Rech, Andreas Harth
146
Voted
SAC
2002
ACM
15 years 3 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...