Sciweavers

983 search results - page 67 / 197
» Negative-Weight Cycle Algorithms
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 5 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
TIME
2007
IEEE
15 years 9 months ago
A Symbolic Decision Procedure for Robust Safety of Timed Systems
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Mani Swaminathan, Martin Fränzle
FPL
2003
Springer
113views Hardware» more  FPL 2003»
15 years 8 months ago
Data Dependent Circuit Design: A Case Study
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...
Shoji Yamamoto, Shuichi Ichikawa, Hiroshi Yamamoto
ICNC
2005
Springer
15 years 8 months ago
Drawing Undirected Graphs with Genetic Algorithms
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
Qing-Guo Zhang, Huayong Liu, Wei Zhang, Ya-Jun Guo
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 8 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste