Sciweavers

1142 search results - page 55 / 229
» Set Variables and Local Search
Sort
View
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
13 years 10 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
COR
2010
121views more  COR 2010»
13 years 10 months ago
Parallel machine scheduling with precedence constraints and setup times
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
Bernat Gacias, Christian Artigues, Pierre Lopez
TEC
2002
163views more  TEC 2002»
13 years 9 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
AIRWEB
2008
Springer
14 years 2 days ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
ICPR
2002
IEEE
14 years 11 months ago
A Neural Architecture for Fast and Robust Face Detection
In this paper, we present a connectionist approach for detecting and precisely localizing semi-frontal human faces in complex images, making no assumption about the content or the...
Christophe Garcia, Manolis Delakis