Sciweavers

990 search results - page 133 / 198
» Sub-Graphs of Complete Graph
Sort
View
FORMATS
2004
Springer
14 years 1 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
DSVIS
1994
Springer
13 years 11 months ago
A Model-Based Approach to Presentation: A Continuum from Task Analysis to Prototype
This paper presents a complete model-based approach to the building of presentation for a business oriented highly interactive application. This approach is considered complete in...
François Bodart, Anne-Marie Hennebert, Isab...
ATAL
2008
Springer
13 years 9 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
MICRO
1998
IEEE
89views Hardware» more  MICRO 1998»
13 years 12 months ago
Load Latency Tolerance in Dynamically Scheduled Processors
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...
Srikanth T. Srinivasan, Alvin R. Lebeck