Sciweavers

1088 search results - page 3 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
ENDM
2010
126views more  ENDM 2010»
13 years 6 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
PVLDB
2010
120views more  PVLDB 2010»
13 years 4 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
PPSN
2004
Springer
13 years 11 months ago
A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
Carlos Cotta, Antonio J. Fernández
CEC
2010
IEEE
13 years 7 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
CLADE
2008
IEEE
14 years 19 days ago
SWARM: a scientific workflow for supporting bayesian approaches to improve metabolic models
With the exponential growth of complete genome sequences, the analysis of these sequences is becoming a powerful approach to build genome-scale metabolic models. These models can ...
Xinghua Shi, Rick Stevens