Sciweavers

43264 search results - page 8491 / 8653
» Comparing models of computation
Sort
View
ATAL
2010
Springer
14 years 11 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
BIRTHDAY
2010
Springer
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
14 years 11 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
CONCUR
2010
Springer
14 years 11 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
CSE
2009
IEEE
14 years 11 months ago
Time Critical Content Delivery Using Predictable Patterns in Mobile Social Networks
In Mobile Social Networks (MSN) individuals with similar interests or commonalities connect to each other using the mobile phones. MSN are special kind of Ad-hoc Networks in which ...
Fawad Nazir, Jianhua Ma, Aruna Seneviratne
« Prev « First page 8491 / 8653 Last » Next »