Sciweavers

1302 search results - page 105 / 261
» On the Strong Chromatic Number
Sort
View
LCTRTS
2005
Springer
15 years 12 months ago
A sample-based cache mapping scheme
Applications running on the StrongARM SA-1110 or XScale processor cores can specify cache mapping for each virtual page to achieve better cache utilization. In this work, we descr...
Rong Xu, Zhiyuan Li
SSS
2005
Springer
15 years 12 months ago
A Snap-Stabilizing DFS with a Lower Space Requirement
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
Alain Cournier, Stéphane Devismes, Vincent ...
TLCA
2005
Springer
15 years 12 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 12 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 12 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka