|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 13 keywords
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
42 | Steffen Reith, Klaus W. Wagner |
On Boolean Lowness and Boolean Highness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, pp. 147-156, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse |
41 | Andrew J. Parkes |
Easy Predictions for the Easy-Hard-Easy Transition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI/IAAI ![In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada., pp. 688-694, 2002, AAAI Press / The MIT Press. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
30 | Dorothy L. Mammen, Tad Hogg |
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 7, pp. 47-66, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Dorothy L. Mammen, Tad Hogg |
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.AI/9707101, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
20 | Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Jordan Suter |
Connections in Networks: Hardness of Feasibility Versus Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, pp. 16-28, 2007, Springer, 978-3-540-72396-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | H. Van Dyke Parunak, Sven Brueckner, John A. Sauter, Robert Savit |
Effort profiles in multi-agent resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The First International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2002, July 15-19, 2002, Bologna, Italy, Proceedings, pp. 248-255, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
effort profile, complexity, resource allocation, negotiation, phase transition, phase change |
17 | Weixiong Zhang |
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 153-167, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Gayathri Namasivayam |
Study of Random Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Proceedings, pp. 555-556, 2009, Springer, 978-3-642-02845-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Gayathri Namasivayam, Miroslaw Truszczynski |
Simple Random Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings, pp. 223-235, 2009, Springer, 978-3-642-04237-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Calin Anton, Lane Olson |
Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Canadian AI ![In: Advances in Artificial Intelligence, 22nd Canadian Conference on Artificial Intelligence, Canadian AI 2009, Kelowna, Canada, May 25-27, 2009, Proceedings, pp. 16-26, 2009, Springer, 978-3-642-01817-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Lucian Leahu, Carla P. Gomes |
LP as a Global Search Heuristic Across Different Constrainedness Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 853, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Tassos Dimitriou |
A Wealth of SAT Distributions with Planted Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 274-287, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
9 | Rhyd Lewis |
Metaheuristics can solve sudoku puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 13(4), pp. 387-401, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Metaheuristics, Phase-transition, Puzzles, Sudoku |
9 | Jano I. van Hemert, Neil Urquhart |
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN VIII, 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings, pp. 151-160, 2004, Springer, 3-540-23092-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
6 | Olaf Beyersdorff, Sebastian Müller 0003 |
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 199-214, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Karp-Lipton Theorem, Optimal Propositional Proof Systems, Extended Frege, Bounded Arithmetic, Advice |
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|