Sciweavers

7820 search results - page 1303 / 1564
» Formalization of Time and Space
Sort
View
169
Voted
ICALP
2001
Springer
15 years 11 months ago
Routing in Trees
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
Pierre Fraigniaud, Cyril Gavoille
166
Voted
IEAAIE
2001
Springer
15 years 11 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
NOSSDAV
2001
Springer
15 years 11 months ago
Lightweight kernel/user communication for real-time and multimedia applications
Operating system enhancements to support real-time and multimedia applications often include specializations and extensions of kernel functionality, as with the kernel HTTP daemon...
Christian Poellabauer, Karsten Schwan, Richard Wes...
OHS
2001
Springer
15 years 11 months ago
XAHM: An XML-Based Adaptive Hypermedia Model and Its Implementation
This paper presents an XML-based Adaptive Hypermedia Model (XAHM) and its modular architecture, for modelling and supporting Adaptive Hypermedia Systems, i.e. hypertext-based multi...
Mario Cannataro, Andrea Pugliese
OOPSLA
2001
Springer
15 years 11 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
« Prev « First page 1303 / 1564 Last » Next »