Sciweavers

5409 search results - page 820 / 1082
» A performance study of client-broker-server systems
Sort
View
RTA
1993
Springer
15 years 10 months ago
Redundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
Christopher Lynch, Wayne Snyder
SIGSOFT
1994
ACM
15 years 10 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
AIED
2007
Springer
15 years 10 months ago
Towards promoting meta-cognition using emotive interface personas within Open-Learner Modelling Environments
: The use of Open-Learner Modelling (OLM) within Intelligent Learning Environments is becoming more common. By allowing learners a greater control over their learning experience, O...
Sylvie Girard
CAV
2006
Springer
132views Hardware» more  CAV 2006»
15 years 10 months ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker