346 search results - page 69 / 70 » Solving quantified constraint satisfaction problems |
124
Voted
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
143
Voted
AIPS
2006
15 years 4 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
135
Voted
DCOSS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
140
Voted
JACIII
2007
15 years 3 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
148
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...