Sciweavers

2432 search results - page 210 / 487
» Degrees and choice numbers
Sort
View
COMPGEOM
2004
ACM
15 years 10 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
CMSB
2006
Springer
15 years 10 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
FPL
2006
Springer
223views Hardware» more  FPL 2006»
15 years 10 months ago
From Equation to VHDL: Using Rewriting Logic for Automated Function Generation
This paper presents a novel tool flow combining rewriting logic with hardware synthesis. It enables the automated generation of synthesizable VHDL code from mathematical equations...
Carlos Morra, M. Sackmann, Sunil Shukla, Jürg...
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...
HYBRID
1995
Springer
15 years 10 months ago
Deciding Reachability for Planar Multi-polynomial Systems
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
Karlis Cerans, Juris Viksna