Sciweavers

418 search results - page 37 / 84
» On the Adders with Minimum Tests
Sort
View
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
ASPLOS
2009
ACM
14 years 8 months ago
CTrigger: exposing atomicity violation bugs from their hiding places
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bu...
Soyeon Park, Shan Lu, Yuanyuan Zhou
ACRI
2006
Springer
14 years 1 months ago
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
Mathias Halbach, Rolf Hoffmann, Lars Both
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Effective Defect Prevention Approach in Software Process for Achieving Better Quality Levels
Defect prevention is the most vital but habitually neglected facet of software quality assurance in any project. If functional at all stages of software development, it can condens...
V. Suma, T. R. Gopalakrishnan Nair
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