197 search results - page 26 / 40 » Some Topological Methods in Graph Coloring Theory |
UAI
1993
13 years 9 months ago
1993
In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
CIKM
2004
Springer
14 years 1 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...