Sciweavers

8671 search results - page 273 / 1735
» A generator for hierarchical problems
Sort
View
AAAI
1998
15 years 8 months ago
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
Berthe Y. Choueiry, Guevara Noubir
164
Voted
SWAP
2007
15 years 7 months ago
Foaf-O-Matic - Solving the Identity Problem in the FOAF Network
An issue that is equally arising both from social networks and the Semantic Web is the fact that, without the consistent use of the same identifier for an object across systems, i...
Stefano Bortoli, Heiko Stoermer, Paolo Bouquet, Ho...
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
15 years 7 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...
COR
2008
118views more  COR 2008»
15 years 6 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
EOR
2006
91views more  EOR 2006»
15 years 6 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira