Sciweavers

1818 search results - page 219 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
COMCOM
2008
80views more  COMCOM 2008»
15 years 3 months ago
Transforming general networks into feed-forward by using turn-prohibition
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...
Juan Echagüe, Jesús E. Villadangos, Vi...
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 3 months ago
Continuation-Passing C, compiling threads to events through continuations
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
Gabriel Kerneis, Juliusz Chroboczek
CORR
2008
Springer
149views Education» more  CORR 2008»
15 years 3 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
DAM
2010
167views more  DAM 2010»
15 years 3 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma