Sciweavers

2621 search results - page 189 / 525
» Near orders and codes
Sort
View
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
AGI
2011
14 years 10 months ago
What Makes a Brain Smart? Reservoir Computing as an Approach for General Intelligence
Abstract. Recurrent connectivity, balanced between excitation and inhibition, is a general principle of cortical connectivity. We propose that balanced recurrence can be achieved b...
Janelle Szary, Bryan Kerster, Christopher T. Kello
CIDR
2011
237views Algorithms» more  CIDR 2011»
14 years 10 months ago
Rethinking Database Algorithms for Phase Change Memory
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...
Shimin Chen, Phillip B. Gibbons, Suman Nath
WOB
2008
128views Bioinformatics» more  WOB 2008»
15 years 8 months ago
Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
Ximing Xu, David Sankoff
TCAD
2008
106views more  TCAD 2008»
15 years 6 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan