Sciweavers

1199 search results - page 209 / 240
» Parameterized Proof Complexity
Sort
View
AIML
2008
13 years 9 months ago
Labelled modal tableaux
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
Guido Governatori
CADUI
2004
13 years 9 months ago
Dialogue-Based Design of Web Usability Questionnaires Using Ontologies
Abstract Questionnaires are nowadays widely used usability evaluation instruments, and several generic usability questionnaires are available. But these generic artifacts are not a...
Elena García Barriocanal, Miguel Áng...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 9 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
WSC
2004
13 years 9 months ago
Approximating Component Selection
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
Michael Roy Fox, David C. Brogan, Paul F. Reynolds...
AAAI
1998
13 years 9 months ago
Supermodels and Robustness
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Ro...