Sciweavers

1200 search results - page 125 / 240
» Marked Ancestor Problems
Sort
View
190
Voted
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 2 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
DM
2010
90views more  DM 2010»
15 years 1 months ago
Knights, spies, games and ballot sequences
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
Mark Wildon
101
Voted
EOR
2008
78views more  EOR 2008»
15 years 1 months ago
Managing the overflow of intensive care patients
Abstract. Many hospitals in the Netherlands are confronted with capacity problems at their Intensive Care Units (ICUs) resulting in cancelling operations, overloading the staff wit...
Nelly Litvak, Marleen van Rijsbergen, Richard J. B...
ASC
2006
15 years 1 months ago
Speeding up the learning of equivalence classes of bayesian network structures
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
Rónán Daly, Qiang Shen, J. Stuart Ai...
79
Voted
ENTCS
2006
103views more  ENTCS 2006»
15 years 1 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...