13306 search results - page 2206 / 2662 » Theoretical Computer Science |
220
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
185
click to vote
CLUSTER
2005
IEEE
16 years 1 months ago
2005
IEEE
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
213
click to vote
SMA
2003
ACM
16 years 25 days ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
187
click to vote
SIGGRAPH
1991
ACM
15 years 11 months ago
1991
ACM
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
212
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...