Sciweavers

277 search results - page 49 / 56
» Just-In-Time Scheduling with Constraint Programming
Sort
View
CASSIS
2005
Springer
14 years 2 months ago
The Design of Application-Tailorable Operating System Product Lines
System software for deeply embedded devices has to cope with a broad variety of requirements and platforms, but especially with strict resource constraints. To compete against prop...
Daniel Lohmann, Wolfgang Schröder-Preikschat,...
CPAIOR
2008
Springer
13 years 10 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
CN
2006
145views more  CN 2006»
13 years 8 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
ENDM
2006
69views more  ENDM 2006»
13 years 8 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 1 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...