2266 search results - page 234 / 454 » Generalizing parametric timing analysis |
121
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
ICALP
1997
Springer
15 years 5 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
134
click to vote
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
106
Voted
TWC
2008
15 years 21 days ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
93
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...