Sciweavers

206 search results - page 36 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 2 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
BMCBI
2010
116views more  BMCBI 2010»
13 years 8 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
ICDE
2010
IEEE
197views Database» more  ICDE 2010»
14 years 7 months ago
Monitoring Continuous State Violation in Datacenters: Exploring the Time Dimension
Monitoring global states of an application deployed over distributed nodes becomes prevalent in today's datacenters. State monitoring requires not only correct monitoring resu...
Shicong Meng, Ting Wang, Ling Liu