Sciweavers

2446 search results - page 269 / 490
» Choiceless Polynomial Time
Sort
View
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 2 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
ESA
2007
Springer
89views Algorithms» more  ESA 2007»
14 years 2 months ago
Bundle Pricing with Comparable Items
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
GBRPR
2007
Springer
14 years 2 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 2 months ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
ICALP
2007
Springer
14 years 2 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...