Sciweavers

1254 search results - page 144 / 251
» Making Hard Problems Harder
Sort
View
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
SIGIR
2005
ACM
14 years 3 months ago
An application of text categorization methods to gene ontology annotation
This paper describes an application of IR and text categorization methods to a highly practical problem in biomedicine, specifically, Gene Ontology (GO) annotation. GO annotation...
Kazuhiro Seki, Javed Mostafa
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
MOBICOM
2004
ACM
14 years 3 months ago
PAVAN: a policy framework for content availabilty in vehicular ad-hoc networks
Advances in wireless communication, storage and processing are realizing next-generation in-vehicle entertainment systems. Even if hundreds of different video or audio titles are...
Shahram Ghandeharizadeh, Shyam Kapadia, Bhaskar Kr...