Sciweavers

1692 search results - page 266 / 339
» A Dynamic Network Interdiction Problem
Sort
View
PERCOM
2007
ACM
16 years 2 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
IWCMC
2010
ACM
15 years 4 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
140
Voted
CSE
2009
IEEE
15 years 6 months ago
Churn Prediction in MMORPGs: A Social Influence Based Approach
Massively Multiplayer Online Role Playing Games (MMORPGs) are computer based games in which players interact with one another in the virtual world. Worldwide revenues for MMORPGs h...
Jaya Kawale, Aditya Pal, Jaideep Srivastava
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 2 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
ICRA
2009
IEEE
132views Robotics» more  ICRA 2009»
15 years 9 months ago
On connectivity maintenance in linear cyclic pursuit
— The paper studies the cyclic pursuit problem in presence of connectivity constraints among single-integrator agents. The robots, each one pursuing its leading neighbor along th...
Fabio Morbidi, Giulio Ripaccioli, Domenico Prattic...