Sciweavers

3690 search results - page 99 / 738
» Computation with classical sequents
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
SIBGRAPI
2005
IEEE
15 years 3 months ago
A Brief Account of the Relations between Gray-Scale Mathematical Morphologies
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
Peter Sussner, Marcos Eduardo Valle
WG
2005
Springer
15 years 3 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
STACS
1999
Springer
15 years 2 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
PPSN
2000
Springer
15 years 1 months ago
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Carlos Cotta, José M. Troya