Sciweavers

16596 search results - page 322 / 3320
» Generalized Assignment Problems
Sort
View
TON
2002
91views more  TON 2002»
15 years 6 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
JAIR
2008
104views more  JAIR 2008»
15 years 6 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
PAMI
2008
155views more  PAMI 2008»
15 years 6 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 8 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
JAC
2008
15 years 8 months ago
Study of the NP-completeness of the compact table problem
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
Jean-Christophe Dubacq, Jean-Yves Moyen