Sciweavers

429 search results - page 30 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
MP
2008
129views more  MP 2008»
13 years 7 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
AI
2009
Springer
14 years 2 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
EAAI
2010
107views more  EAAI 2010»
13 years 2 months ago
Honey bee social foraging algorithms for resource allocation: Theory and application
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
Nicanor Quijano, Kevin M. Passino
RTSS
2003
IEEE
14 years 29 days ago
A Consensus Protocol for CAN-Based Systems
Consensus is known to be a fundamental problem in fault-tolerant distributed systems. Solving this problem provides the means for distributed processes to agree on a single value....
George M. de A. Lima, Alan Burns
ICC
2009
IEEE
177views Communications» more  ICC 2009»
14 years 2 months ago
Reducing Power Consumption in Backbone Networks
—According to several studies, the power consumption of the Internet accounts for up to 10% of the worldwide energy consumption, and several initiatives are being put into place ...
Luca Chiaraviglio, Marco Mellia, Fabio Neri