Sciweavers

9325 search results - page 267 / 1865
» The decentralized implementability problem
Sort
View
EOR
2007
90views more  EOR 2007»
15 years 4 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í
157
Voted
TPDS
2002
126views more  TPDS 2002»
15 years 3 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
MOR
2010
108views more  MOR 2010»
15 years 2 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
CHI
2003
ACM
16 years 4 months ago
MiTAP for real users, real data, real problems
The MiTAP system was developed as an experimental prototype using human language technologies for monitoring disease outbreaks. The system provides timely, multi-lingual, global i...
Laurie E. Damianos, Steve Wohlever, Robyn Kozierok...
LSSC
2005
Springer
15 years 9 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova