3250 search results - page 189 / 650 » Parameterized Learning Complexity |
159
click to vote
CSL
2000
Springer
15 years 11 months ago
2000
Springer
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
179
click to vote
DAC
1999
ACM
15 years 10 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...
158
click to vote
ER
1999
Springer
15 years 10 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 ...
183
click to vote
CGI
2009
IEEE
15 years 10 months 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...
194
click to vote
FCT
2007
Springer
15 years 10 months 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...