Sciweavers

934 search results - page 49 / 187
» exact 2007
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 9 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
DLT
2003
14 years 11 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
INFOCOM
2007
IEEE
15 years 4 months ago
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N ...
Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-S...
EXACT
2007
15 years 2 days ago
A Discourse Approach to Explanation Aware Knowledge Representation
This study describes a discourse approach to explanation aware knowledge representation. It presents a reasoning model that adheres to argumentation as found in written discourse,...
Andrew Potter
ATMOS
2007
161views Optimization» more  ATMOS 2007»
14 years 11 months ago
Periodic Railway Timetabling with Event Flexibility
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
Gabrio Curzio Caimi, Martin Fuchsberger, Marco Lau...