921 search results - page 156 / 185 » Expressing Computational Complexity in Constructive Type The... |
IWPC
2002
IEEE
14 years 1 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
MOR
2010
13 years 6 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
While in computer networks the number of possible protocol encapsulations is growing day after day, network administrators face ever increasing difficulties in selecting accurately...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
LICS
2006
IEEE
14 years 2 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...