BibSonomy bookmarks for /user/draganigajic/optimization

Nailgun is a client, protocol, and server for running Java programs from the command line without incurring the JVM startup overhead. Programs run in the server (which is implemented in Java), and are triggered by the client (written in C), which handles all I/O.

10 Ways to Improve Your Web Page Performance | Six Revisions

draganigajic — 2011-07-13T18:12:22+02:00

http://sixrevisions.com/web-development/10-ways-to-improve-your-web-page-performance/

Improve your jQuery - 25 excellent tips

draganigajic — 2011-07-13T18:12:22+02:00

* 1 Load the framework from Google Code * 3 Combine all your scripts and minify them * 5 Keep selection operations to a mini by caching * 6 Keep DOM manipulation to a min * 7 Wrap everything in a single element when inserting DOM * 8 Use IDs instead of classes wherever possible * 9 Give your selectors a context * 10 Use chaining properly * 11 use animate properly * 12 Learn about event delegation * 13 Use classes to store state * 14 or use jQuery's internal data() method to store state * 15 Write your own selectors * 16 Streamline your HTML and modify it once the page has loaded * 17 Lazy load content for speed and SEO benefits * 18 Use jQuery's utility functions * 19 Use noconflict to rename the jquery object when using other frameworks * 20 How to tell when images have loaded * 22 How to check if an element exists * 23 Add a JS class to your HTML attribute * 24 Return 'false' to prevent default behaviour * 25 Shorthand for the ready event

searching w iterated maps pnas 2007

draganigajic — 2011-07-13T18:12:18+02:00

In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku.Our survey of applications shows the difference map algorithm often achieves results comparable to much more sophisticated, special purpose algorithms. Efficient implementations of constraint projections usually are easier than designing the linear program solver at the heart of many optimization algorithms.