Sciweavers

15033 search results - page 116 / 3007
» Complexity Theory and Algorithms
Sort
View
147
Voted
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
137
Voted
ECAI
2000
Springer
15 years 8 months ago
Intention Reconsideration in Theory and Practice
Abstract. Autonomous agents operating in complex dynamic environments need the ability to integrate robust plan execution with higher level reasoning. This paper describes work to ...
Simon Parsons, Ola Pettersson, Alessandro Saffiott...
136
Voted
ALT
2007
Springer
15 years 10 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
128
Voted
SIGSOFT
2006
ACM
15 years 9 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
150
Voted
AUTONOMICS
2009
ACM
15 years 10 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...