Sciweavers

2043 search results - page 399 / 409
» Some Basics on Tolerances
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
SAC
2002
ACM
13 years 9 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
SPE
2002
105views more  SPE 2002»
13 years 9 months ago
Specifying a role-based guide for learning to work with an enterprise framework
Learning to work with enterprise frameworks requires considerable effort, because of the inherent complexity of all the knowledge that is needed. However, different roles in proje...
Wilhelm Hasselbring, Ralph van den Houdt
STVR
2002
111views more  STVR 2002»
13 years 9 months ago
Can fault-exposure-potential estimates improve the fault detection abilities of test suites?
Code-coverage-based test data adequacy criteria typically treat all coverable code elements (such as statements, basic blocks, or outcomes of decisions) as equal. In practice, how...
Wei Chen, Roland H. Untch, Gregg Rothermel, Sebast...
COR
2007
106views more  COR 2007»
13 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...