Sciweavers

1795 search results - page 299 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
EACL
1989
ACL Anthology
13 years 11 months ago
User studies and the design of Natural Language Systems
This paper presents a critical discussion of the various approaches that have been used in the evaluation of Natural Language systems. We conclude that previous approaches have ne...
Steve Whittaker, Phil Stenton
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 11 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
CAEPIA
2009
Springer
13 years 11 months ago
Closeness and Distance Relations in Order of Magnitude Qualitative Reasoning via PDL
The syntax, semantics and an axiom system for an extension of Propositional Dynamic Logic (PDL) for order of magnitude qualitative reasoning which formalizes the concepts of close...
Alfredo Burrieza, Emilio Muñoz-Velasco, Man...
CCGRID
2010
IEEE
13 years 11 months ago
SLA-Driven Dynamic Resource Management for Multi-tier Web Applications in a Cloud
Current service-level agreements (SLAs) offered by cloud providers do not make guarantees about response time of Web applications hosted on the cloud. Satisfying a maximum average ...
Waheed Iqbal, Matthew N. Dailey, David Carrera
ECAI
2010
Springer
13 years 11 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...