Sciweavers

1058 search results - page 80 / 212
» It's Doomed; We Can Prove It
Sort
View
CAV
2006
Springer
121views Hardware» more  CAV 2006»
15 years 1 months ago
Deriving Small Unsatisfiable Cores with Dominators
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...
Roman Gershman, Maya Koifman, Ofer Strichman
JGT
2007
87views more  JGT 2007»
14 years 9 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 7 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
EUROPLOP
2006
14 years 11 months ago
Migrating to e-Learning in Secondary Education
Traditional face-to-face instruction in secondary education has been tested for hundreds of years now and has proven successful, but after the tremendous expansion of computer and...
Michalis Hadjisimou, Aimilia Tzanavari
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
14 years 1 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...