2520 search results - page 230 / 504 » The complexity of approximating entropy |
219
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
165
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
180
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
190
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...