Sciweavers

2031 search results - page 182 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
HPDC
1998
IEEE
15 years 2 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon
LOPSTR
1999
Springer
15 years 2 months ago
Annotations for Prolog - A Concept and Runtime Handling
Abstract. A concept of annotations for rendering procedural aspects of Prolog is presented, built around wellknown procedural concepts of Standard Prolog. Annotations describe prop...
Marija Kulas
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
15 years 2 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
VISUALIZATION
1997
IEEE
15 years 2 months ago
Constrained 3D navigation with 2D controllers
Navigation through 3D spaces is required in many interactive graphics and virtual reality applications. We consider the subclass of situations in which a 2D device such as a mouse...
Andrew J. Hanson, Eric A. Wernert
SIGCOMM
1997
ACM
15 years 2 months ago
Small Forwarding Tables for Fast Routing Lookups
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...