default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen M. Majercik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p2]Stephen M. Majercik:
Stochastic Boolean Satisfiability. Handbook of Satisfiability 2021: 1331-1369
2010 – 2019
- 2017
- [c13]Frank Mauceri, Stephen M. Majercik:
A Swarm Environment for Experimental Performance and Improvisation. EvoMUSART 2017: 190-200 - 2014
- [c12]Stephen M. Majercik:
Using Fluid Neural Networks to Create Dynamic Neighborhood Topologies in Particle Swarm Optimization. ANTS Conference 2014: 270-277 - 2013
- [c11]Stephen M. Majercik:
GREEN-PSO: Conserving Function Evaluations in Particle Swarm Optimization. IJCCI 2013: 160-167 - 2012
- [c10]William K. Richard, Stephen M. Majercik:
Swarm-based path creation in dynamic environments for search and rescue. GECCO (Companion) 2012: 1401-1402 - [c9]Stephen M. Majercik:
Initial Experiments in Using Communication Swarms to Improve the Performance of Swarm Systems. IWSOS 2012: 109-114
2000 – 2009
- 2009
- [p1]Stephen M. Majercik:
Stochastic Boolean Satisfiability. Handbook of Satisfiability 2009: 887-925 - 2007
- [j3]Stephen M. Majercik:
APPSSAT: Approximate probabilistic planning using stochastic satisfiability. Int. J. Approx. Reason. 45(2): 402-419 (2007) - 2005
- [c8]Stephen M. Majercik, Byron Boots:
DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently. AAAI 2005: 416-422 - [c7]Stephen M. Majercik:
APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability. ECSQARU 2005: 209-220 - 2004
- [c6]Stephen M. Majercik:
Nonchronological Backtracking in Stochastic Boolean Satisfiability. ICTAI 2004: 498-507 - 2003
- [j2]Stephen M. Majercik, Michael L. Littman:
Contingent planning under uncertainty via stochastic satisfiability. Artif. Intell. 147(1-2): 119-162 (2003) - 2002
- [c5]Stephen M. Majercik, Andrew P. Rusczek:
Faster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings. AIPS 2002: 163-172 - 2001
- [j1]Michael L. Littman, Stephen M. Majercik, Toniann Pitassi:
Stochastic Boolean Satisfiability. J. Autom. Reason. 27(3): 251-296 (2001)
1990 – 1999
- 1999
- [c4]Stephen M. Majercik, Michael L. Littman:
Contingent Planning Under Uncertainty via Stochastic Satisfiability. AAAI/IAAI 1999: 549-556 - [c3]Stephen M. Majercik:
Planning Under Uncertainty via Stochastic Statisfiability. AAAI/IAAI 1999: 950 - 1998
- [c2]Stephen M. Majercik, Michael L. Littman:
Using Caching to Solve Larger Probabilistic Planning Problems. AAAI/IAAI 1998: 954-959 - [c1]Stephen M. Majercik, Michael L. Littman:
MAXPLAN: A New Approach to Probabilistic Planning. AIPS 1998: 86-93
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 2024-04-24 23:20 CEST 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:
