Sciweavers

36 search results - page 6 / 8
» Model Checking on Trees with Path Equivalences
Sort
View
FCT
2003
Springer
14 years 21 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
14 years 21 days ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 7 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
NIL
1991
13 years 11 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
PTS
2008
165views Hardware» more  PTS 2008»
13 years 9 months ago
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Farn Wang, Geng-Dian Huang