Sciweavers

4894 search results - page 754 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
IADIS
2004
13 years 9 months ago
Electronic case studies: a problem-based learning approach
E-Cases is an innovative approach to management development. Traditional case studies typically describe a decision or a problem in a real-life setting. E-Cases encourage students...
Philip M. Drinkwater, Christopher P. Holland, K. N...
ESANN
2003
13 years 9 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
NIPS
2001
13 years 9 months ago
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, J...
UAI
2004
13 years 9 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 9 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...