Sciweavers

294 search results - page 48 / 59
» A hybrid metaheuristic approach to solving the UBQP problem
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
ICASSP
2010
IEEE
13 years 6 months ago
A hierarchical Bayesian model for frame representation
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
Lotfi Chaâri, Jean-Christophe Pesquet, Jean-...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 8 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
13 years 12 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
ATAL
2008
Springer
13 years 9 months ago
A Hybrid Reputation Model Based on the Use of Organizations
In this paper we present a hybrid reputation model focused on organizational structures that attempts to solve problems associated with both centralized and decentralized reputatio...
Viviane Torres da Silva, Ramón Hermoso, Rob...