1199 search results - page 154 / 240 » Parameterized Proof Complexity |
DAC
1999
ACM
14 years 1 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
ER
1999
Springer
14 years 1 months ago
1999
Springer
We propose a method for modeling complex Web sources that have active user interaction requirements. Here active" refers to the fact that certain information in these sources ...
CGI
2009
IEEE
14 years 24 days ago
2009
IEEE
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
FCT
2007
Springer
14 years 24 days ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
ATAL
2006
Springer
14 years 19 days ago
2006
Springer
Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions...