Sciweavers

4679 search results - page 6 / 936
» Modeling When Connections Are the Problem
Sort
View
AIPS
2010
15 years 1 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
ENTCS
2010
141views more  ENTCS 2010»
14 years 9 months ago
Debugging as a Science, that too, when your Program is Changing
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
Abhik Roychoudhury
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
SAINT
2006
IEEE
15 years 3 months ago
Fluid-Based Analysis of a Network with DCCP Connections and RED Routers
In this paper, we model DCCP congestion control mechanism and RED as independent discrete-time systems using fluid-flow approximation. By interconnecting DCCP connections and RE...
Hiroyuki Hisamatsu, Hiroyuki Ohsaki, Masayuki Mura...
MWCN
2004
Springer
15 years 3 months ago
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
Roberto Montemanni, Luca Maria Gambardella