Sciweavers

2605 search results - page 67 / 521
» The many levels of CSCL
Sort
View
CP
2005
Springer
15 years 12 months ago
SPREAD: A Balancing Constraint Based on Statistics
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
Gilles Pesant, Jean-Charles Régin
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 11 months ago
Adaptation and the effort needed to adapt
— Tuning a system to an operating environment calls for experimentation, and a question that arises naturally is: how many experiments are needed to come up with a system meeting...
Sergio Bittanti, Marco C. Campi, Maria Prandini
QOFIS
2000
Springer
15 years 10 months ago
A Markovian Model for TCP Analysis in a Differentiated Services Network
Many schemes have been proposed to support TCP traffic in a Differentiated Services network. We present in this paper an analytical model to study the performance of these schemes....
Chadi Barakat, Eitan Altman
CAISE
1995
Springer
15 years 10 months ago
Process Improvement - The Way Forward
, methods, techniques and tools. High level languages, structured programming, abstract data types, formal methods, non-procedural programming, object orientation, CASE, support en...
M. M. Lehman
CPAIOR
2008
Springer
15 years 8 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...