Sciweavers

116 search results - page 22 / 24
» Toward a Question Answering Roadmap
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 26 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SIGMETRICS
2010
ACM
143views Hardware» more  SIGMETRICS 2010»
14 years 12 days ago
Practical performance models for complex, popular applications
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
Eno Thereska, Bjoern Doebel, Alice X. Zheng, Peter...
VLDB
1999
ACM
145views Database» more  VLDB 1999»
13 years 12 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
IWSSD
1993
IEEE
13 years 11 months ago
Fine-Grain Process Modelling
In this paper, we propose the use of fine-grain process modelling as an aid to software development. We suggest the use of two levels of granularity, one at the level of the indiv...
Bashar Nuseibeh, Anthony Finkelstein, Jeff Kramer
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin