Sciweavers

1055 search results - page 120 / 211
» Enumerations in computable structure theory
Sort
View
AAAI
2010
13 years 11 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
APIN
2002
80views more  APIN 2002»
13 years 10 months ago
Searching a Scalable Approach to Cerebellar Based Control
Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore...
Jan Peters, P. Patrick van der Smagt
AUTOMATICA
2002
263views more  AUTOMATICA 2002»
13 years 10 months ago
Analysis of discrete-time piecewise affine and hybrid systems
In this paper we present various algorithms both for stability and performance analysis of discrete-time Piece-Wise Affine (PWA) systems. For stability, different classes of Lyapu...
Giancarlo Ferrari-Trecate, Francesco Alessandro Cu...
ACL
2010
13 years 8 months ago
Learning to Translate with Source and Target Syntax
Statistical translation models that try to capture the recursive structure of language have been widely adopted over the last few years. These models make use of varying amounts o...
David Chiang
COMPGEOM
2011
ACM
13 years 1 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...