Sciweavers

15033 search results - page 2624 / 3007
» Complexity Theory and Algorithms
Sort
View
CP
2009
Springer
16 years 7 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
SIGCSE
2009
ACM
130views Education» more  SIGCSE 2009»
16 years 7 months ago
Introducing PyLighter: dynamic code highlighter
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...
Michael G. Boland, Curtis C. Cliburn
HPCA
2009
IEEE
16 years 7 months ago
Variation-aware dynamic voltage/frequency scaling
Fine-grained dynamic voltage/frequency scaling (DVFS) is an important tool in managing the balance between power and performance in chip-multiprocessors. Although manufacturing pr...
Sebastian Herbert, Diana Marculescu
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 7 months ago
Co-evolution of social and affiliation networks
In our work, we address the problem of modeling social network generation which explains both link and group formation. Recent studies on social network evolution propose generati...
Elena Zheleva, Hossam Sharara, Lise Getoor
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
« Prev « First page 2624 / 3007 Last » Next »