Sciweavers

9532 search results - page 106 / 1907
» Logic, Graphs, and Algorithms
Sort
View
IJIT
2004
15 years 19 days ago
Synthesis of Logic Circuits Using Fractional-Order Dynamic Fitness Functions
This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuit...
Cecília Reis, José António Te...
FOSSACS
2004
Springer
15 years 4 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
GD
2008
Springer
15 years 9 days ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow
GD
2001
Springer
15 years 3 months ago
A Characterization of DFS Cotree Critical Graphs
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
Hubert de Fraysseix, Patrice Ossona de Mendez
FUIN
2007
135views more  FUIN 2007»
14 years 11 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner