1968 search results - page 136 / 394 » The Complexity of Valued Constraint Models |
169
Voted
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
143
Voted
EDOC
2004
IEEE
15 years 8 months ago
2004
IEEE
Availability of a wide variety of Web services over the Internet offers opportunities of providing new value added services built by composing them out of existing ones. Service c...
131
click to vote
UAI
1998
15 years 5 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
127
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
121
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data “auditing...