Sciweavers

551 search results - page 73 / 111
» Continuous Search in Constraint Programming
Sort
View
IJCAI
2003
13 years 9 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
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...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
COR
2010
123views more  COR 2010»
13 years 7 months ago
Decomposition, reformulation, and diving in university course timetabling
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...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
CORR
2008
Springer
78views Education» more  CORR 2008»
13 years 7 months ago
Verified Null-Move Pruning
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...
Omid David-Tabibi, Nathan S. Netanyahu
SIGSOFT
2003
ACM
14 years 8 months ago
Consistency techniques for interprocedural test data generation
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 ...
Nguyen Tran Sy, Yves Deville
PLDI
2010
ACM
14 years 23 days ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama