Sciweavers

10907 search results - page 269 / 2182
» Constraint Based Strategies
Sort
View
151
Voted
AAAI
2004
15 years 7 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann
ROBOCUP
2001
Springer
96views Robotics» more  ROBOCUP 2001»
15 years 10 months ago
Strategy Learning for a Team in Adversary Environments
Team strategy acquisition is one of the most important issues of multiagent systems, especially in an adversary environment. RoboCup has been providing such an environment for AI a...
Yasutake Takahashi, Takashi Tamura, Minoru Asada
ORGSCI
2008
54views more  ORGSCI 2008»
15 years 6 months ago
On the Problem of Participation in Strategy: A Critical Discursive Perspective
We still know little of why strategy processes often involve participation problems. In this paper, we argue that this crucial issue is linked to fundamental assumptions concernin...
Saku Mantere, Eero Vaara
GLOBECOM
2008
IEEE
16 years 13 days ago
On Strategies for Source Information Transmission over MIMO Systems
—We consider strategies for the lossy transmission of a zero mean Gaussian source over a 2×2 MIMO channel with Rayleigh fading. The source is represented either using a single d...
Marco Zoffoli, Jerry D. Gibson, Marco Chiani
TARK
2007
Springer
16 years 3 days ago
Alternating-time temporal logics with irrevocable strategies
In Alternating-time Temporal Logic (atl), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: “agent i ca...
Thomas Ågotnes, Valentin Goranko, Wojciech J...