Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Journal of Computer and System Sciences
Academic Press, Inc.
 
   
 
Options:
 
  1-10 of 86 reviews Date Reviewed 
  A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Gao Y., Guan H., Qi Z., Hou Y., Liu L. Journal of Computer and System Sciences 79(8): 1230-1242, 2013.  Type: Article

Virtualization is a powerful method for achieving good utilization of physical servers, but finding the optimal mapping of virtual machines (VMs) on the servers of a data center is a challenging problem, and in particular, a multi-obje...

Dec 15 2014
  Search methods for tile sets in patterned DNA self-assembly
Göös M., Lempiäinen T., Czeizler E., Orponen P. Journal of Computer and System Sciences 80(1): 297-319, 2014.  Type: Article

A very important area of nanotechnology--self-assembly--is addressed in this paper. It considers several algorithmic approaches (exhaustive branch and bound, heuristics with some relaxed objectives, and answer set pro...

Sep 11 2014
  The hardness of counting full words compatible with partial words
Manea F., Tiseanu C. Journal of Computer and System Sciences 79(1): 7-22, 2013.  Type: Article

Sequences of symbols from a given alphabet are known as words. If symbols are unknown at some positions, then such sequences are known as partial words. Two partial words are said to be compatible when they agree in all positions where...

Apr 22 2014
  Parameterized complexity of connected even/odd subgraph problems
Fomin F., Golovach P. Journal of Computer and System Sciences 80(1): 157-179, 2014.  Type: Article

The notion of fixed parameter tractability involves relaxed polynomial-time complexity, which admits algorithms whose runtimes are exponential, but only in terms of some parameter that is expected to be small. More formally, a problem ...

Jan 2 2014
  Trustworthiness analysis of sensor data in cyber-physical systems
Tang L., Yu X., Kim S., Gu Q., Koutra D., Leung A., La Porta T. Journal of Computer and System Sciences 79(3): 383-401, 2013.  Type: Article

A cyber-physical system (CPS) is the large-scale global integration of distributed sensing systems. With the growing importance of and need for CPS applications, a number of research challenges need to be solved. One such problem invol...

Jul 31 2013
  Synonymous theories and knowledge representations in answer set programming
Pearce D., Valverde A. Journal of Computer and System Sciences 78(1): 86-104, 2012.  Type: Article

The problem of determining the equivalence of knowledge descriptions (logical theories, ontologies, programs, databases, and so on) is an important one, not only in core knowledge representation and reasoning topics, but also in many e...

Feb 13 2013
   Cloud federation in a layered service model
Villegas D., Bobroff N., Rodero I., Delgado J., Liu Y., Devarakonda A., Fong L., Masoud Sadjadi S., Parashar M. Journal of Computer and System Sciences 78(5): 1330-1344, 2012.  Type: Article

In this paper, Villegas et al. tackle the problem of federating different cloud infrastructures (with the same service interfaces) by leveraging a layered service model. The layers are those defined by the National Institute of Standar...

Jan 3 2013
  On bounded block decomposition problems for under-specified systems of equations
Bomhoff M., Kern W., Still G. Journal of Computer and System Sciences 78(1): 336-347, 2012.  Type: Article

Consider a set of equations (not necessarily linear) with several unknowns, which is not over-determined. We could, of course, solve the whole set; however, it might be possible to solve a subset, plug the values thus obtained into the...

Apr 26 2012
  Computing optimal outcomes under an expressive representation of settings with externalities
Conitzer V., Sandholm T. Journal of Computer and System Sciences 78(1): 2-14, 2012.  Type: Article

Computing optimal allocations is a ubiquitous and notoriously hard computational problem that is significant in settings such as combinatorial auctions. This paper considers an expressive representation of such settings in which agents...

Apr 19 2012
  Accurate and precise aggregation counting
Preparata F. Journal of Computer and System Sciences 78(1): 192-197, 2012.  Type: Article

It was a struggle writing this review--not because the paper was difficult to comprehend, but because it was so succinct. In fact, it would be hard to convey the information presented in fewer words. As such, my summary risks ...

Mar 22 2012
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy