Sciweavers

619 search results - page 75 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
CAMAD
2006
IEEE
13 years 11 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 7 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson
IJNSEC
2007
157views more  IJNSEC 2007»
13 years 7 months ago
Balancing Trust and Incentive in Peer-to-Peer Collaborative System
In order to maximize resource utilization as well as providing trust management in P2P computing environments, we propose a novel framework - Trust-Incentive Service Management (T...
Yu Zhang, Li Lin, Jinpeng Huai
LOCA
2007
Springer
14 years 1 months ago
Information Overlay for Camera Phones in Indoor Environments
Increasingly, cell phones are used to browse for information while location systems assist in gathering information that is most appropriate to the user’s current location. We se...
Harlan Hile, Gaetano Borriello
POS
1987
Springer
13 years 11 months ago
Realisation of a Dynamically Grouped Object-Oriented Virtual Memory Hierarchy
Conventional paging systems do not perform well with large object-oriented environments (such as Smalltalk-801 [GR83]) due to the fine granularity of objects and the persistence o...
Ifor Williams, Mario Wolczko, T. P. Hopkins