Sciweavers

2968 search results - page 185 / 594
» Network Programming Using PLAN
Sort
View
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 8 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
ECOOP
1999
Springer
15 years 7 months ago
Providing Fine-grained Access Control for Java Programs
There is considerable interest in programs that can migrate from one host to another and execute. Mobile programs are appealing because they support efficient utilization of networ...
Raju Pandey, Brant Hashii
ISI
2007
Springer
15 years 9 months ago
Organizing Hot-Spot Police Patrol Routes
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
Sudarshan S. Chawathe
JGO
2011
83views more  JGO 2011»
14 years 10 months ago
Application of convex lexicographical optimization to the balance of GRTgaz gas grid
Shippers are daily users of the French gas grid. Differences between planned and effective gas demand unbalance the grid. To restore the balance, GRTgaz computes every day amoun...
Soizic Adam, J. Frédéric Bonnans, Ru...
INFOCOM
2007
IEEE
15 years 9 months ago
Stream: Low Overhead Wireless Reprogramming for Sensor Networks
— Wireless reprogramming of a sensor network is useful for uploading new code or for changing the functionality of existing code. Through the process, a node should remain recept...
Rajesh Krishna Panta, Issa Khalil, Saurabh Bagchi