Sciweavers

552 search results - page 33 / 111
» Lower bounds for dynamic connectivity
Sort
View
CSL
2007
Springer
14 years 3 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 4 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
ATAL
2009
Springer
14 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
APNOMS
2006
Springer
14 years 1 months ago
The Soft Bound Admission Control Algorithm for Vertical Handover in Ubiquitous Environment
Abstract. In this paper, we present SBAC (Soft Bound Admission Control) algorithm considering critical bandwidth ratio to reduce handover blocking probability over WLAN and WAAN (W...
Ok Sik Yang, Jong Min Lee, Jun Kyun Choi, Seong Go...