Sciweavers

2266 search results - page 285 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
126
Voted
EVOW
2006
Springer
15 years 7 months ago
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
Peter I. Cowling, Nic Colledge, Keshav P. Dahal, S...
137
Voted
FSTTCS
2003
Springer
15 years 8 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
DAC
2009
ACM
16 years 4 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
147
Voted
IANDC
2008
122views more  IANDC 2008»
15 years 3 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
125
Voted
PIMRC
2010
IEEE
15 years 1 months ago
Asymptotic analysis of distributed multi-cell beamforming
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
Subhash Lakshminaryana, Jakob Hoydis, Mérou...