Sciweavers

9405 search results - page 333 / 1881
» Computing a Model of Set Theory
Sort
View
KES
2006
Springer
15 years 5 months ago
A computational framework for package planning
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
Yang Xiang, Michael Janzen
ITIIS
2010
150views more  ITIIS 2010»
15 years 3 months ago
Computational Trust and Its Impact over Rational Purchasing Decisions of Internet Users
As web-based online communities are rapidly growing, the agents in the communities need to know their measurable belief of trust for safe and successful interactions. In this pape...
Sanguk Noh
134
Voted
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 10 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
130
Voted
COMPGEOM
2010
ACM
15 years 10 months 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 9 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