Sciweavers

81 search results - page 3 / 17
» Approximating module semantics with constraints
Sort
View
IJCAI
2003
13 years 6 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
EACL
2003
ACL Anthology
13 years 6 months ago
A Flexible Pragmatics-Driven Language Generator for Animated Agents
This paper describes the NECA MNLG; a fully implemented Multimodal Natural Language Generation module. The MNLG is deployed as part of the NECA system which generates dialogues be...
Paul Piwek
INFORMS
2010
145views more  INFORMS 2010»
13 years 3 months ago
An Automated Intensity-Modulated Radiation Therapy Planning System
We design and implement an intensity-modulated radiation therapy (IMRT) plan generation technology that effectively and efficiently optimizes beam geometry as well as beam intens...
Shabbir Ahmed, Ozan Gozbasi, Martin W. P. Savelsbe...
ICDE
1997
IEEE
92views Database» more  ICDE 1997»
14 years 6 months ago
Distributing Semantic Constraints Between Heterogeneous Databases
In recent years, research about distributing databases over networks has become increasingly important. Here we concentrate on the issues of interoperability of heterogeneous DBMS...
Stefan Grufman, Fredrik Samson, Suzanne M. Embury,...
DBPL
2005
Springer
130views Database» more  DBPL 2005»
13 years 11 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...