Sciweavers

14165 search results - page 422 / 2833
» The generalized two-server problem
Sort
View
FCT
2005
Springer
16 years 10 days ago
Leftist Grammars and the Chomsky Hierarchy
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
Tomasz Jurdzinski, Krzysztof Lorys
CP
2000
Springer
15 years 11 months ago
Singleton Consistencies
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
Patrick Prosser, Kostas Stergiou, Toby Walsh
CIARP
2003
Springer
15 years 10 months ago
Uniclass and Multiclass Connectionist Classification of Dialogue Acts
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
María José Castro Bleda, David Vilar...
AAAI
2008
15 years 9 months ago
Zero-data Learning of New Tasks
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
Hugo Larochelle, Dumitru Erhan, Yoshua Bengio
AIPS
2009
15 years 8 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner