Sciweavers

682 search results - page 73 / 137
» Philosophical Issues in Computer Science
Sort
View
RTA
2004
Springer
14 years 2 months ago
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
Salvador Lucas
SPIN
2004
Springer
14 years 2 months ago
Validation of UML Models via a Mapping to Communicating Extended Timed Automata
Abstract. We present a technique and a tool for model-checking operational UML models based on a mapping of object oriented UML models into a framework of communicating extended ti...
Iulian Ober, Susanne Graf, Ileana Ober
ACSC
2002
IEEE
14 years 1 months ago
Bandwidth Reservation Strategies for Mobility Support of Wireless Connections with QoS Guarantees
This paper examines QoS guarantees for bandwidth in mobile wireless networks, with a focus on reducing dropped connections on handoff. We can achieve this by reserving bandwidth f...
R. Hutchens, S. Singh
FOCS
2002
IEEE
14 years 1 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
FOCS
2000
IEEE
14 years 1 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg