Sciweavers

9842 search results - page 1550 / 1969
» Problem complexity
Sort
View
CHI
2004
ACM
16 years 7 months ago
Persistence matters: making the most of chat in tightly-coupled work
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
Darren Gergle, David R. Millen, Robert E. Kraut, S...
CHI
2004
ACM
16 years 7 months ago
Safety-critical interaction: usability in incidents and accidents
Recent years have seen an increasing use of sophisticated interaction techniques in the field of command and control systems. The use of such techniques has been required in order...
Philippe A. Palanque, Floor Koornneef, Chris Johns...
CADE
2008
Springer
16 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
CADE
2006
Springer
16 years 7 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
OSDI
2004
ACM
16 years 7 months ago
Using Magpie for Request Extraction and Workload Modelling
Tools to understand complex system behaviour are essential for many performance analysis and debugging tasks, yet there are many open research problems in their development. Magpi...
Paul Barham, Austin Donnelly, Rebecca Isaacs, Rich...
« Prev « First page 1550 / 1969 Last » Next »