Sciweavers

388 search results - page 74 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
IWCLS
2007
Springer
14 years 2 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
DAWAK
2004
Springer
14 years 2 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 13 days ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
13 years 7 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
INFOCOM
2002
IEEE
14 years 1 months ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra