Sciweavers

16596 search results - page 7 / 3320
» Generalized Assignment Problems
Sort
View
FCT
2009
Springer
15 years 4 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
FOCS
1999
IEEE
15 years 1 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
COR
2007
143views more  COR 2007»
14 years 9 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
AAIM
2005
Springer
81views Algorithms» more  AAIM 2005»
14 years 11 months ago
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
Xiao-Dong Hu, Tianping Shuai
CVPR
2010
IEEE
15 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler