Sciweavers

2767 search results - page 61 / 554
» Universal Exponentiation Algorithm
Sort
View
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
14 years 11 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 6 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
15 years 3 months ago
Estimating the size of the telephone universe: a Bayesian Mark-recapture approach
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...
David Poole
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 4 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
ICPR
2002
IEEE
15 years 11 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha