Sciweavers

118 search results - page 8 / 24
» Complexity Cores and Hard Problem Instances
Sort
View
CLIMA
2010
13 years 7 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
EOR
2008
72views more  EOR 2008»
13 years 7 months ago
The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent ...
Christine Solnon, Van Dat Cung, Alain Nguyen, Chri...
DCC
2008
IEEE
14 years 7 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
BMCBI
2007
216views more  BMCBI 2007»
13 years 7 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...