Sciweavers

210 search results - page 15 / 42
» Some Competition Programming Problems as the Beginning of Ar...
Sort
View
CP
2003
Springer
15 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
NMR
2004
Springer
15 years 2 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
IAT
2010
IEEE
14 years 7 months ago
Using Negotiation to Reduce Redundant Autonomous Mobile Program Movements
Distributed load managers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This paper shows that systems of Autonomou...
Natalia Chechina, Peter King, Phil Trinder
CEC
2008
IEEE
15 years 3 months ago
A novel co-evolutionary approach to automatic software bug fixing
— Many tasks in Software Engineering are very expensive, and that has led the investigation to how to automate them. In particular, Software Testing can take up to half of the re...
Andrea Arcuri, Xin Yao
CP
2005
Springer
15 years 3 months ago
Weak Symmetries in Problem Formulations
Abstract. In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and pres...
Roland Martin, Karsten Weihe