4117 search results - page 87 / 824 » On the Satisfiability of Complex Constraints |
157
click to vote
SIGGRAPH
2000
ACM
15 years 10 months ago
2000
ACM
Traditional collision intensive multi-body simulations are difficult to control due to extreme sensitivity to initial conditions or model parameters. Furthermore, there may be mu...
157
click to vote
ACL
2003
15 years 7 months ago
2003
In statistical machine translation, the generation of a translation hypothesis is computationally expensive. If arbitrary wordreorderings are permitted, the search problem is NP-h...
132
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
167
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
179
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...