Exhaustive search for algorithms - existing works? -

-

you might have read twice idea becomes clear. please patient.
i'm looking existing work exhausive search algorithms given problems. exhaustive search known brute force search, or brute force.

other exhaustive search algorithms search solution given problem. usually, solution such problem data fulfills requirements.

exhaustive search example:
want solution knapsack problem. objects can packed bag there no other combination of objects fit bag , sum bigger value result combination.
can solve going on possible combinations (exhaustive) , search 1 fits bag , valuable 1 of combinations.

what i'm looking special case of exhaustive search: exhaustive search searches algorithm solution. in end, i'm looking algorithm searches algorithm solves given problem.

you might say: go google it. well, yes i've done that. difficulty i'm facing here googling "algorithm searches algorithm" results in same "another search algorithm". obviously, has many unwanted results, i'm stuck here.

how can find existing work related exhaustive search algorithms?
more specifically: has there software been written this? can point me links or algorithm names/better keywords in relation topic?

update:
purpose i'm looking such algorithm search solving problems no heuristics known, e.g. prooving-algorithms or trying finding other solution algorithms problems might or might not np-complete problems (thus proving problem not np-complete if faster algorithm can found; without human interaction).

you seem looking "program synthesis", can work in limited instances, provided can correctly , formally specify algorithm supposed (without giving implementation). synthesis effective approach build gate-level circuits, applying synthesis software far still more of research avenue practical.

still, here couple of references on subject,

(some of advanced work in area in opinion, has tool) program sketching armando solar-lezama

check out microsoft research page on topic, think it's hot topic: http://research.microsoft.com/en-us/um/people/sumitg/pubs/synthesis.html

some other similar stuff i've seen : model checking-based genetic programming application mutual exclusion. (katz & peled @ tacas '08), have more recent version on arxiv : http://arxiv.org/abs/1402.6785

essentially search space explored (exhaustively) using model-checker.


Comments

Post a Comment

Popular posts from this blog

php - Zend Framework / Skeleton-Application / Composer install issue -

-
i trying create zend framework application using skeleton in netbeans. when run composer install, following error message: "c:\php\php.exe" "c:\composer\composer.phar" "--ansi" "--no-interaction" "update" "--dev" using deprecated option "dev". dev packages installed default now. loading composer repositories package information updating dependencies (including require-dev) requirements not resolved installable set of packages. problem 1 - package requires php >=5.5 php version (5.4.42) not satisfy requirement. problem 2 - installation request zendframework/zendframework 2.5.1 -> satisfiable zendframework/zendframework[2.5.1]. - zendframework/zendframework 2.5.1 requires php >=5.5 -> php version (5.4.42) not satisfy requirement. done. apparently, zend framework only needs php 5.3+ contradicts above. need use php 5.4. my composer.json following: { "name": "
Read more

c# - Better 64-bit byte array hash -

-
i need hash algorithm produces 64-bit hash code ( long ) fewer collisions string.gethashcode() , fast (no expensive calls cryptographic functions). here's implementation of fnv still shows 3% of collisions after testing 2 million random strings. need number way lower. void main() { const string chars = "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz!#@$%^&*()_+}{\":?><,./;'[]0123456789\\"; const int n = 2000000; var random = new random(); var hashes = new hashset<long>(); int collisions = 0; for(int = 0; < n; i++) { var len = random.next(chars.length); var str = new char[len]; (int j = 0; j < len; j++) { str[j] = chars[random.next(chars.length)]; } var s = new string(str); if(!hashes.add(get64bithash( s ))) collisions++; } console.writeline("collision percentage after " + n + " random strings: " + ((doubl
Read more

python - PyCharm Type error Message -

-
i'm newbie trying out ml/dbn in python (3.4) under pycharm (comm.ed 4.5). following definition def make_thetas(xmin,xmax,n): xs = np.linespace(xmin,xmax,n) widths = (xs[1:] - xs[:-1])/2.0 thetas = xs[:-1] + widths return thetas throws error "class 'tuple' not define ' sub ', '-' operator cannot used on instance" on - operator on third line (widths = ....) ideas on how code running under pycharm - works alright in interactive python window. thx. to all, after g'g lot have found workaround seems work within pycharm. workaround because (even python newbie) expected python not need explicit typecasting, not when using datatypes imported lib such numpy. def make_thetas(xmin,xmax,n): xs = np.array(np.linspace(xmin,xmax,n)) widths = (xs[1:] - xs[:-1])/2.0 thetas = xs[:-1]+ widths return thetas using docstrings type-hinting such below did not work def make_thetas(xmin,xmax,n): "&q
Read more