2911 search results - page 450 / 583 » A Logic of Graph Constraints |
123
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
125
click to vote
ICDCIT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
93
Voted
SEMWEB
2005
Springer
15 years 6 months ago
2005
Springer
The paper reports on the formal framework to design strategies for multi-issue non-symmetric meaning negotiations among software agents in a distributed information retrieval syste...
101
click to vote
SIGECOM
2004
ACM
15 years 6 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...