Sciweavers

1912 search results - page 247 / 383
» GOAL as a Planning Formalism
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Cooperative Boolean games
We present and formally investigate Cooperative Boolean Games, a new, natural family of coalitional games that are both compact and expressive. In such a game, an agent's pri...
Paul E. Dunne, Wiebe van der Hoek, Sarit Kraus, Mi...
CASCON
1992
134views Education» more  CASCON 1992»
15 years 7 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
TOPLAS
2008
101views more  TOPLAS 2008»
15 years 6 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
TPDS
2008
163views more  TPDS 2008»
15 years 6 months ago
Managing the Mobility of a Mobile Sensor Network Using Network Dynamics
It has been discussed in the literature that the mobility of a mobile sensor network (MSN) can be used to improve its sensing coverage. How the mobility can efficiently be managed ...
Ke Ma, Yanyong Zhang, Wade Trappe
AI
2004
Springer
15 years 6 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne