Sciweavers

1888 search results - page 149 / 378
» Proof theory and computational analysis
Sort
View
176
Voted
COMPGEOM
2010
ACM
16 years 2 days ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
MCS
2001
Springer
15 years 11 months ago
Error Rejection in Linearly Combined Multiple Classifiers
In this paper, the error-reject trade-off of linearly combined multiple classifiers is analysed in the framework of the minimum risk theory. Theoretical analysis described in [12,1...
Giorgio Fumera, Fabio Roli
190
Voted
LOGCOM
2006
82views more  LOGCOM 2006»
15 years 7 months ago
Embedding Alternating-time Temporal Logic in Strategic STIT Logic of Agency
Seeing To It That (STIT) logic is a logic of agency, proposed in the 1990s in the domain of philosophy of action. It is the logic of constructions of the form `agent a sees to it ...
Jan Broersen, Andreas Herzig, Nicolas Troquard
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
15 years 6 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
IAT
2008
IEEE
16 years 1 months ago
Auction Analysis by Normal Form Game Approximation
Auctions are pervasive in today’s society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by int...
Michael Kaisers, Karl Tuyls, Frank Thuijsman, Simo...