Sciweavers

9842 search results - page 152 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
123
Voted
EOR
2007
159views more  EOR 2007»
15 years 3 months ago
Solving the semi-desirable facility location problem using bi-objective particle swarm
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
Haluk Yapicioglu, Alice E. Smith, Gerry V. Dozier
CN
2004
85views more  CN 2004»
15 years 3 months ago
The multicast address allocation problem: theory and practice
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
Daniel Zappala, Virginia Mary Lo, Chris GauthierDi...
133
Voted
JC
2000
135views more  JC 2000»
15 years 3 months ago
Decision Problems in Quadratic Function Fields of High Genus
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
Renate Scheidler
146
Voted
ICPPW
2009
IEEE
15 years 1 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 6 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...