Sciweavers

948 search results - page 129 / 190
» What can we achieve by arbitrary announcements
Sort
View
JACM
2006
134views more  JACM 2006»
13 years 8 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
CHI
2010
ACM
14 years 1 months ago
Share: a programming environment for loosely bound cooperation
We introduce a programming environment entitled Share that is designed to encourage loosely bound cooperation between individuals within communities of practice through the sharin...
Yannick Assogba, Judith S. Donath
ARTQOS
2003
Springer
14 years 15 days ago
Differentiation and Interaction of Traffic: A Flow Level Study
We study what kind of differentiation can be achieved using DiffServ without admission control and using a relative services approach, i.e. the rate of the flow should be in propor...
Eeva Nyberg, Samuli Aalto
FOIS
2006
13 years 10 months ago
Nontological Engineering
This article reflects an ongoing effort to systematize the use of terms applied by philosophers and computer scientists in the context of ontology and ontological engineering. We s...
Waclaw Kusnierczyk
ICPR
2008
IEEE
14 years 10 months ago
Selecting relevant features for human motion recognition
Recently, there is a growing interest in automatic recognition of human motion for applications, such as humanoid robots, human activity monitoring, and surveillance. In this pape...
Dirk Gehrig, Tanja Schultz