Sciweavers

16596 search results - page 104 / 3320
» Generalized Assignment Problems
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
15 years 3 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
15 years 2 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
ICEC
1994
82views more  ICEC 1994»
14 years 11 months ago
Improving Search by Incorporating Evolution Principles in Parallel Tabu Search
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
Ivan De Falco, Renato Del Balio, Ernesto Tarantino...
INFOCOM
2002
IEEE
15 years 2 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...