Sciweavers

1984 search results - page 91 / 397
» The colourful feasibility problem
Sort
View
EAAI
2007
154views more  EAAI 2007»
13 years 10 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
EOR
2010
93views more  EOR 2010»
13 years 10 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
14 years 2 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a speciļ¬c problem class, namely deterministic production planning probl...
Yves Pochet
SECON
2007
IEEE
14 years 4 months ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
ā€” The coverage and connectivity problem in sensor networks has received signiļ¬cant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
JAR
2000
145views more  JAR 2000»
13 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro