Sciweavers

1322 search results - page 134 / 265
» Parameterized counting problems
Sort
View
INFOCOM
2002
IEEE
14 years 3 months ago
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches
— High-aggregate bandwidth switches are those whose port count multiplied by the operating line rate is very high; for example, a 30 port switch operating at 40 Gbps or a 1000 po...
Paolo Giaccone, Balaji Prabhakar, Devavrat Shah
MFCS
2007
Springer
14 years 4 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
14 years 4 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
CPAIOR
2010
Springer
14 years 2 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
14 years 1 months ago
Crossover gene selection by spatial location
Spatial based gene selection for division of chromosomes used by crossover operators is proposed for three-dimensional problems. This spatial selection is shown to preserve more g...
David M. Cherba, William F. Punch