We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Remote presentation is an interesting model for executing applications in mobile devices, since applications can be executed on a server and their interfaces displayed on mobile c...
Andre Luiz Camargos Tavares, Marco Tulio de Olivei...
In online shopping scenarios, it can be difficult for consumers to process the vast amounts of information available and to make satisfactory buying decisions. Interactive decision...