3204 search results - page 531 / 641 » The b-chromatic Number of a Graph |
142
click to vote
ICALP
2007
Springer
16 years 20 days 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...
159
click to vote
MFCS
2007
Springer
16 years 19 days 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...
153
click to vote
PEPM
2007
ACM
16 years 19 days 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...
162
click to vote
POLICY
2007
Springer
16 years 19 days 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...
158
click to vote
TACAS
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...