default search action
Bradford Heap
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c12]Alfred Krzywicki, Bradford Heap, Michael Bain, Wayne Wobcke, Susanne Schmeidl:
Using Word Embeddings with Linear Models for Short Text Classification. Australasian Conference on Artificial Intelligence 2018: 819-827 - [c11]Alfred Krzywicki, Wayne Wobcke, Michael Bain, Susanne Schmeidl, Bradford Heap:
A Knowledge Acquisition Method for Event Extraction and Coding Based on Deep Patterns. PKAW 2018: 16-31 - [c10]Gavin Katz, Bradford Heap, Wayne Wobcke, Michael Bain, Sandeepa Kannangara:
Analysing TV Audience Engagement via Twitter: Incremental Segment-Level Opinion Mining of Second Screen Tweets. PRICAI 2018: 300-308 - 2017
- [c9]Bradford Heap, Alfred Krzywicki, Susanne Schmeidl
, Wayne Wobcke, Michael Bain:
A Joint Human/Machine Process for Coding Events and Conflict Drivers. ADMA 2017: 639-654 - [i1]Bradford Heap, Michael Bain, Wayne Wobcke, Alfred Krzywicki, Susanne Schmeidl:
Word Vector Enrichment of Low Frequency Words in the Bag-of-Words Model for Short Text Multi-class Classification Problems. CoRR abs/1709.05778 (2017) - 2014
- [b1]Bradford Heap:
Sequential Single-Cluster Auctions for Multi-Robot Task Allocation. University of New South Wales, Sydney, Australia, 2014 - [c8]Bradford Heap, Maurice Pagnucco:
Minimising Undesired Task Costs in Multi-Robot Task Allocation Problems with In-Schedule Dependencies. AAAI 2014: 2542-2548 - [c7]Bradford Heap, Alfred Krzywicki, Wayne Wobcke, Michael Bain, Paul Compton:
Combining Career Progression and Profile Matching in a Job Recommender System. PRICAI 2014: 396-408 - 2013
- [c6]Bradford Heap, Maurice Pagnucco:
Repeated Sequential Single-Cluster Auctions with Dynamic Tasks for Multi-Robot Task Allocation with Pickup and Delivery. MATES 2013: 87-100 - [c5]Bradford Heap:
Sequential Single-Cluster Auctions. MATES 2013: 408-411 - [c4]Bradford Heap, Maurice Pagnucco
Repeated Auctions for Reallocation of Tasks with Pickup and Delivery upon Robot Failure. PRIMA 2013: 461-469 - 2012
- [c3]Bradford Gregory John Heap, Maurice Pagnucco:
Repeated Sequential Auctions with Dynamic Task Clusters. AAAI 2012: 1997-2002 - [c2]Bradford Heap, Maurice Pagnucco
Analysis of Cluster Formation Techniques for Multi-robot Task Allocation Using Sequential Single-Cluster Auctions. Australasian Conference on Artificial Intelligence 2012: 839-850 - 2011
- [c1]Bradford Heap, Maurice Pagnucco
Sequential Single-Cluster Auctions for Robot Task Allocation. Australasian Conference on Artificial Intelligence 2011: 412-421
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: