Sciweavers

5030 search results - page 178 / 1006
» cases 2007
Sort
View
EJC
2010
15 years 7 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
COMPUTING
2007
78views more  COMPUTING 2007»
15 years 7 months ago
Calculating lower bounds for caching problems
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
Leah Epstein, Rob van Stee
202
Voted
FASE
2007
Springer
16 years 1 months ago
Contract-Driven Development
Although unit tests are recognized as an important tool in software development, programmers prefer to write code, rather than unit tests. Despite the emergence of tools like JUni...
Bertrand Meyer
MODELS
2007
Springer
16 years 1 months ago
Piecewise Modelling with State Subtypes
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
Friedrich Steimann, Thomas Kühne
EOR
2007
73views more  EOR 2007»
15 years 7 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...