Sciweavers

3433 search results - page 387 / 687
» Heuristics for a bidding problem
Sort
View
AE
2009
Springer
15 years 8 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
AIPS
2009
15 years 8 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
HPDC
2008
IEEE
15 years 7 months ago
A two-level scheduler to dynamically schedule a stream of batch jobs in large-scale grids
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
Marco Pasquali, Ranieri Baraglia, Gabriele Capanni...
COMCOM
2008
124views more  COMCOM 2008»
15 years 7 months ago
Quick convergecast in ZigBee beacon-enabled tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Meng-Shiuan Pan, Yu-Chee Tseng
CONSTRAINTS
2008
89views more  CONSTRAINTS 2008»
15 years 6 months ago
A Reinforcement Learning Approach to Interval Constraint Propagation
When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to th...
Frédéric Goualard, Christophe Jerman...