2485 search results - page 166 / 497 » Time Bounded Frequency Computations |
160
click to vote
ENTCS
2007
15 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
175
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
151
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
193
click to vote
CSR
2007
Springer
16 years 13 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
152
click to vote
HYBRID
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...