Sciweavers

6142 search results - page 1148 / 1229
» The Complexity of Partition Functions
Sort
View
IUI
2006
ACM
15 years 10 months ago
Who's asking for help?: a Bayesian approach to intelligent assistance
Automated software customization is drawing increasing attention as a means to help users deal with the scope, complexity, potential intrusiveness, and ever-changing nature of mod...
Bowen Hui, Craig Boutilier
PODC
2006
ACM
15 years 10 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 10 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...
SIGMETRICS
2006
ACM
106views Hardware» more  SIGMETRICS 2006»
15 years 10 months ago
Automatic logging of operating system effects to guide application-level architecture simulation
Modern architecture research relies heavily on applicationlevel detailed pipeline simulation. A time consuming part of building a simulator is correctly emulating the operating sy...
Satish Narayanasamy, Cristiano Pereira, Harish Pat...
ASAP
2005
IEEE
121views Hardware» more  ASAP 2005»
15 years 9 months ago
Using TLM for Exploring Bus-based SoC Communication Architectures
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
Sudeep Pasricha, Mohamed Ben-Romdhane
« Prev « First page 1148 / 1229 Last » Next »