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
  Orponen, Pekka Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  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  
  Probably approximately optimal satisficing strategies
Greiner R. (ed), Orponen P. Artificial Intelligence 82(1-2): 21-44, 1996.  Type: Article

A decision structure is a finite structure that specifies a set of sequences of experiments and results leading to decisions. It is called “tree-like” if one can identify with each experiment s a unique seque...
...
Mar 1 1997  
  Instance complexity
Orponen P., Ko K., Schöning U., Watanabe O. Journal of the ACM 41(1): 96-121, 1994.  Type: Article

What is a hard instance of a computational problem? This paper formalizes the intuitive idea that problems are hard if and only if they have infinitely many intrinsically hard instances. The authors introduce i c t ...
...
Dec 1 1994  

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