3471 search results - page 598 / 695 » Obstacle Numbers of Graphs |
149
click to vote
HPCC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
119
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
132
Voted
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
130
click to vote
PEPM
2007
ACM
15 years 11 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
126
click to vote
POLICY
2007
Springer
15 years 11 months ago
2007
Springer
Obligation Policies specify management actions that must be performed when a particular kind of event occurs and certain conditions are satisfied. Large scale distributed systems...