778 search results - page 72 / 156 » Expressiveness and complexity of graph logic |
116
click to vote
AAMAS
2008
Springer
15 years 19 days ago
2008
Springer
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
125
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
OTM
2007
Springer
15 years 6 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
114
Voted
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
115
Voted
JAIR
2002
15 years 5 days ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...