Sciweavers

2100 search results - page 29 / 420
» Fundamentals of the problem
Sort
View
SRDS
2000
IEEE
14 years 2 months ago
Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agreement Problems
Fault-tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the...
Stefan Pleisch, André Schiper
SPLC
2004
13 years 11 months ago
Experiences in Software Product Families: Problems and Issues During Product Derivation
A fundamental reason for investing in product families is to minimize the application engineering costs. Several organizations that employ product families, however, are becoming i...
Sybren Deelstra, Marco Sinnema, Jan Bosch
EOR
2007
158views more  EOR 2007»
13 years 10 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
EOR
2007
90views more  EOR 2007»
13 years 10 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
ECCC
2011
234views ECommerce» more  ECCC 2011»
13 years 5 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan