Sciweavers

ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 3 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
14 years 3 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
ICANNGA
2007
Springer
184views Algorithms» more  ICANNGA 2007»
14 years 3 months ago
Automatic Synthesis for Quantum Circuits Using Genetic Algorithms
Abstract. This paper proposes an automated quantum circuit synthesis approach, using a genetic algorithm. We consider the circuit as a successive rippling of the so-called gate sec...
Cristian Ruican, Mihai Udrescu, Lucian Prodan, Mir...
ICANNGA
2007
Springer
14 years 3 months ago
Particle Swarms for Multimodal Optimization
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
Ender Özcan, Murat Yilmaz
ICALP
2007
Springer
14 years 3 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
14 years 3 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 3 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 3 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
14 years 3 months ago
Finding safety errors with ACO
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
Enrique Alba, J. Francisco Chicano
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
14 years 3 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono