Sciweavers

1297 search results - page 74 / 260
» fews 2007
Sort
View
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
15 years 6 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
WDAG
2007
Springer
97views Algorithms» more  WDAG 2007»
15 years 6 months ago
On the Message Complexity of Indulgent Consensus
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 6 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
XPU
2007
Springer
15 years 6 months ago
Predicting Software Defect Density: A Case Study on Automated Static Code Analysis
The number of defects is an important indicator of software quality. Agile software development methods put an explicit requirement on automation and permanently low defect rates. ...
Artem Marchenko, Pekka Abrahamsson
XPU
2007
Springer
15 years 6 months ago
Usability in Agile Software Development: Extending the Interaction Design Process with Personas Approach
The current agile software development methods do not seem to address usability and interaction design issues enough, i.e., the interaction design process may remain implicit. Howe...
Jukka Haikara