Sciweavers

1984 search results - page 220 / 397
» The colourful feasibility problem
Sort
View
WEBDB
2009
Springer
115views Database» more  WEBDB 2009»
16 years 1 months ago
A Machine Learning Approach to Foreign Key Discovery
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
Alexandra Rostin, Oliver Albrecht, Jana Bauckmann,...
ICANNGA
2009
Springer
212views Algorithms» more  ICANNGA 2009»
16 years 1 months ago
Evolutionary Regression Modeling with Active Learning: An Application to Rainfall Runoff Modeling
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Ivo Couckuyt, Dirk Gorissen, Hamed Rouhani, Eric L...
CEC
2008
IEEE
16 years 29 days ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
CISS
2008
IEEE
16 years 28 days ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
ECRTS
2008
IEEE
16 years 28 days ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...