Sciweavers

8437 search results - page 657 / 1688
» Preferences over Sets
Sort
View
FORTE
2009
15 years 5 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
15 years 2 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
COLING
2010
15 years 2 months ago
Document Expansion Based on WordNet for Robust IR
The use of semantic information to improve IR is a long-standing goal. This paper presents a novel Document Expansion method based on a WordNet-based system to find related concep...
Eneko Agirre, Xabier Arregi, Arantxa Otegi
KI
2011
Springer
15 years 2 months ago
Centurio, a General Game Player: Parallel, Java- and ASP-based
Abstract We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by technique...
Maximilian Möller, Marius Thomas Schneider, M...
TIT
2011
116views more  TIT 2011»
15 years 2 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth