9842 search results - page 1749 / 1969 » Problem complexity |
210
click to vote
TMC
2012
13 years 9 months ago
2012
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
230
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
157
click to vote
CASES
2004
ACM
16 years 1 days ago
2004
ACM
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
208
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
166
click to vote
AAAI
1998
15 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...