2917 search results - page 123 / 584 » Satisfying Interaction Constraints |
QSIC
2007
IEEE
14 years 4 months ago
2007
IEEE
Current WSDL-based description specifies only the operation signatures and locations of Web services. It is widely recognized that a richer description is needed. WS-Security, WS-...
ECAI
2008
Springer
13 years 12 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
AAAI
2010
13 years 11 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
ADCM
2007
13 years 10 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...