6110 search results - page 95 / 1222 » Approximate Computing |
156
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
176
click to vote
SGP
2007
15 years 8 months ago
2007
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
154
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
155
click to vote
CMSB
2009
Springer
16 years 25 days ago
2009
Springer
Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time st...
166
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...