Sciweavers

256 search results - page 38 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
200
Voted
IWCLS
2007
Springer
15 years 9 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
160
Voted
AAAI
1994
15 years 4 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
119
Voted
FPGA
2009
ACM
154views FPGA» more  FPGA 2009»
15 years 10 months ago
Synthesis of reconfigurable high-performance multicore systems
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...
Jason Cong, Karthik Gururaj, Guoling Han
131
Voted
CMSB
2006
Springer
15 years 7 months ago
Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
111
Voted
EOR
2007
89views more  EOR 2007»
15 years 3 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...