551 search results - page 73 / 111 » Continuous Search in Constraint Programming |
141
click to vote
IJCAI
2003
15 years 4 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...
128
Voted
COR
2010
15 years 3 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
91
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
148
click to vote
SIGSOFT
2003
ACM
16 years 4 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
142
click to vote
PLDI
2010
ACM
15 years 8 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...