Sciweavers

3211 search results - page 553 / 643
» On the Grundy Number of a Graph
Sort
View
PEPM
2007
ACM
14 years 3 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
POLICY
2007
Springer
14 years 3 months ago
Specifying and Enforcing High-Level Semantic Obligation Policies
Obligation Policies specify management actions that must be performed when a particular kind of event occurs and certain conditions are satisfied. Large scale distributed systems...
Zhen Liu, Anand Ranganathan, Anton Riabov
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
14 years 3 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...
TELETRAFFIC
2007
Springer
14 years 3 months ago
Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks
Multi-service mesh networks allow existence of guaranteed delay Quality-of-Service (QoS) traffic streams such as Voice over IP and best effort QoS traffic streams such as file tr...
Petar Djukic, Shahrokh Valaee
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 3 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs