Back to Results
First PageMeta Content
NP-complete problems / Combinatorics / Mathematical optimization / Partition problem / Heuristics / Graph theory / Heuristic function / Bin packing problem / Travelling salesman problem / Mathematics / Theoretical computer science / Computational complexity theory


Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,
Add to Reading List

Document Date: 2013-07-29 02:04:54

Open Document

File Size: 300,84 KB

Share Result on Facebook

City

Cambridge / Glasgow / Oxford / /

Company

Patrick Prosser / Vertex / Ewan MacIntyre / /

Country

United States / United Kingdom / Scotland / /

/

Facility

University of Strathclyde / /

IndustryTerm

genetic algorithm / greedy backtracking algorithm / stochastic approximation algorithms / greedy algorithm / power law / search tree / erent search procedures / binary search tree / search engine / physical systems / compare algorithms / heuristic solutions / /

Organization

twg@cs.strath.ac.uk Department of Computer Science / University of Strathclyde / Computational Intelligence / /

Person

Ian P. Gent / Toby Walsh / /

ProvinceOrState

Massachusetts / /

Technology

artificial intelligence / compare algorithms / greedy algorithm / greedy backtracking algorithm / benchmark algorithms / genetic algorithm / stochastic approximation algorithms / search engine / Ckk algorithm / benchmarking algorithms / 3g / /

SocialTag