Sciweavers

8647 search results - page 1364 / 1730
» The Container Selection Problem
Sort
View
MST
2007
122views more  MST 2007»
15 years 4 months ago
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
Lali Barrière, Paola Flocchini, Pierre Frai...
HEURISTICS
2010
15 years 1 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...
BMCBI
2011
14 years 11 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 11 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 11 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...
« Prev « First page 1364 / 1730 Last » Next »