78 search results - page 11 / 16 » Local Search Algorithms for Partial MAXSAT |
102
click to vote
AAAI
2004
15 years 1 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
103
click to vote
IJCAI
2003
15 years 1 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
103
click to vote
AIPS
2006
15 years 1 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 ...
EVOW
2001
Springer
15 years 4 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
ICASSP
2010
IEEE
15 years 4 days ago
2010
IEEE
This paper presents a new approach for estimating the disparity search range in stereo video that enforces temporal consistency. Reliable search range estimation is very important...