Sciweavers

4430 search results - page 833 / 886
» Solving Optimization Problems with DLL
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Distributed Placement of Service Facilities in Large-Scale Networks
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
Nikolaos Laoutaris, Georgios Smaragdakis, Konstant...
EDCC
2010
Springer
14 years 2 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 2 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 2 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...